Parallel construction of conflict graph for phylogenetic network problem

Authors:
D. S. Rao;G. N. Kumar;Dheeresh K. Mallick;Prasanta K. Jana
Affiliations:
Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India;Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India;Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, India;Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India
Venue:
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Year:
2007

Citing 3
Cited 0

Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Fine Structure of Galls in Phylogenetic Networks

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conflict graph is used as the major tool in various algorithms [14] - [18] for solving the phylogenetic network problem. The over all time complexity of these algorithms mainly depends on the construction of the conflict graph. In this paper, we present a parallel algorithm for building a conflict graph. Given a set of n binary sequences, each of size m, our algorithm is mapped on a triangular array in O(n) time using O(m2) processors.