Efficient reconstruction of phylogenetic networks with constrained recombination

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Volumn , Issue , 2003, Pages 363-374

  Gusfield, D ^a   Eddhu, Satish ^a   Langley, C ^b  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; COMBINATORIAL MATHEMATICS; TELECOMMUNICATION NETWORKS;

COMPATIBILITY PROBLEMS; EFFICIENT RECONSTRUCTION; IMPLICIT REPRESENTATION; NODE-DISJOINT CYCLES; PHYLOGENETIC NETWORKS; PHYLOGENETIC TREES; RECOMBINATION CYCLES; SUFFICIENT TESTS;

TREES (MATHEMATICS);

EID: 84960341535     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2003.1227337     Document Type: Conference Paper

References (12)

1. W. H. Day and D. Sankoff. Computational complexity of inferring phylogenies by compatibility. Syst. Zool., 35:224-229, 1986.
2. D. Gusfield. Efficient algorithms for inferring evolutionary history. Networks, 21:19-28, 1991.
3. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
4. J. Hein. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci, 98:185-200, 1990.
5. J. Hein. A heuristic metohd to reconstruct the history of sequences subject to recombination. J. Mol. Evol., 36:396-405, 1993.
6. R. Hudson and N. Kaplan. Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics, 111:147-164, 1985.
7. J. D. Kececioglu and D. Gusfield. Reconstructing a history of recombinations from a set of sequences. Discrete Applied Math., pages 239-260, 1998.
8. J.Z. Lin, A. Brown, and M. T. Clegg. Heterogeneous geographic patterns of nucleotide sequence diversity between two alcohol dehydrogenase genes in wild barley (Hordeum vulgare subspecies spontaneum). PNAS, 98:531-536, 2001.
9. S. R. Myers and R. C. Griffiths. Bounds on the minimum number of recombination events in a sample history. Genetics, 163:375-394, 2003.
10. D. Posada and K. Crandall. Intraspecific gene genealogies: trees grafting into networks. Trends in Ecology and Evolution, 16:37-45, 2001.
11. M. H. Schierup and J. Hein. Consequences of recombination on traditional phylogenetic analysis. Genetics, 156:879-891, 2000.
12. L. Wang, K. Zhang, and L. Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8:69-78, 2001.