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(m 2) processors.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21, 19–28 (1991)
Schierup, M.H., Hein, J.: Consequences of recombination on traditional phylogenetic analysis. Genetics 156, 879–891 (2000)
Schierup, M.H., Hein, J.: Recombination and the molecular clock. Mol. Biol. Evol. 17, 1578–1579 (2000)
Posada, D., Crandall, K.: The effect of recombination on the accuracy of phylogeny estimation. Journal of Molecular Evolution 54, 396–402 (2002)
Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185–200 (1990)
Hein, J.: A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396–405 (1993)
Song, Y., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. Journal of Mathematical Biology 48, 160–186 (2003)
Song, Y., Hein, J.: Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events. In: Proc. of 2003 Workshop on Algorithms in Bioinformatics, Berlin, Germany (2003)
Linder, C.R., Moret, B.M.E., Nakhleh, L., Warnow, T.: Reconstructing networks part II: computational aspects. In: the ninth pacific symposium on Biocomputing (2004)
Zahid, M.A.H., Mittal, A., Joshi, R.C.: Use of phylogenetic networks and its reconstruction algorithms. Journal of Bioinformatics India 4, 47–58 (2005)
Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology 8, 69–78 (2001)
Hudson, R.R., Kaplan, N.L.: Statistical properties of the number of recombination events in the History of a sample of DNA sequences. Genetics 111, 147–164 (1985)
Myers, S.R., Griffths, R.C.: Bounds on the minimum number of recombination events in a sample history. Genetics 163, 375–394 (2003)
Gusfield, D., Satish, E., Langley, C.: Efficient reconstruction of phylogenetic networks (of SNPs) with constrained recombination. In: Proceedings of 2nd CSB Bioinformatics Conference, Los Alamitos, CA (2003)
Gusfield, D., Satish, E., Langley, C.: Optimal efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology 2, 173–213 (2004)
Gusfield, D.: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained recombination, Technical Report, Department of Computer Sc., University of California, Davis, CA
Gusfield, D., Satish, E., Langley, C.: The fine structure of galls in phylogenetic networks. Informs Journal on Computing 16, 459–469 (2004)
Bafna, V., Bansal, V.: The number of recombination events in a sample history conflict graph and lower bounds. IEEE Ttrans. on Computational Biology and Bioinformatics 1, 78–90 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, D.S., Kumar, G.N., Mallick, D.K., Jana, P.K. (2007). Parallel Construction of Conflict Graph for Phylogenetic Network Problem. In: Ghosh, A., De, R.K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2007. Lecture Notes in Computer Science, vol 4815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77046-6_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-77046-6_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77045-9
Online ISBN: 978-3-540-77046-6
eBook Packages: Computer ScienceComputer Science (R0)