Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

Journal of Computer and System Sciences

Volumn 70, Issue 3, 2005, Pages 381-398

  Gusfield, Dan ^a  

^a University of California   (United States)

Author keywords

Ancestral recombination graph; Gene conversion; Molecular evolution; Perfect phylogeny; Phylogenetic networks; Recombination; Recurrent mutation; SNP

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SIMULATION; DISEASES; GENETIC ENGINEERING; GRAPH THEORY; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; MUTAGENESIS; TREES (MATHEMATICS);

ANCESTRAL RECOMBINATION GRAPHS; GENE-CONVERSION; MOLECULAR EVOLUTION; PERFECT PHYLOGENY; PHYLOGENETIC NETWORKS; RECOMBINATION; RECURRENT MUTATION; SINGLE NUCLEOTIDE POLYMORPHISM (SNP);

COMPUTER NETWORKS;

EID: 15344339638     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.12.009     Document Type: Article

References (29)

1. V. Bafna, and V. Bansal The number of recombination events in a sample history conflict graph and lower bounds IEEE/ACM Trans. Comput. Biol. Bioinform. 1 2004 78 90
2. V. Bafna, D. Gusfield, S. Hannenhalli, and S. Yooseph A note on efficient computation of haplotypes via perfect phylogeny J. Comput. Biol. 11 5 2004 858 866
3. A. Berry, and A. Barbadilla Gene conversion is a major determinant of genetic diversity at the DNA level R.S. Singh C.B. Krimbas Evolutionary Genetics From Molecules to Morphology 1999 Cambridge University Press Cambridge 102 123
4. A. Chakravarti It's raining SNP's, hallelujah? Nat. Genet. 19 1998 216 217
5. S. Eddhu, Personal communication.
6. J. Felsenstein Inferring Phylogenies 2004 Sinauer Sunderland, MA
7. D. Gusfield Efficient algorithms for inferring evolutionary history Networks 21 1991 19 28
8. D. Gusfield Algorithms on Strings, Trees and Sequences Computer Science and Computational Biology 1997 Cambridge University Press Cambridge, UK
9. D. Gusfield, S. Eddhu, C. Langley, Efficient reconstruction of phylogenetic networks (of SNPs) with constrained recombination, in: Proceedings of Second CSB Bioinformatics Conference, Los Alamitos, CA, 2003, IEEE Press, New York.
10. D. Gusfield, S. Eddhu, and C. Langley The fine structure of galls in phylogenetic networks INFORMS J. Comput. (Special issue on Computational Biology) 16 2004 459 469
11. D. Gusfield, S. Eddhu, and C. Langley Optimal, efficient reconstruction of phylogenetic networks with constrained recombination J. Bioinform. Comput. Biol. 2 1 2004 173 213
12. D. Gusfield, D. Hickerson, A new lower bound on the number of needed recombination nodes in both unrooted and rooted phylogenetic networks, Report UCD-ECS-06, Technical Report, University of California, Davis, 2004.
13. E. Halperin, R. Karp, Perfect phylogeny and haplotype assignment, in: Proceedings of RECOMB 2004: The Eighth Annual International Conference Research in Computational Molecular Biology, ACM Press, New York, 2004, pp. 10-19.
14. J. Hein Reconstructing evolution of sequences subject to recombination using parsimony Math. Biosci. 98 1990 185 200
15. J. Hein A heuristic method to reconstruct the history of sequences subject to recombination J. Mol. Evol. 36 1993 396 405
16. R. Hudson Generating samples under the Wright-Fisher neutral model of genetic variation Bioinformatics 18 2 2002 337 338
17. R. Hudson, and N. Kaplan Statistical properties of the number of recombination events in the history of a sample of DNA sequences Genetics 111 1985 147 164
18. B. Moret, L. Nakhleh, T. Warnow, C.R. Linder, A. Tholse, A. Padolina, J. Sun, R. Timme, Phylogenetic networks: modeling, reconstructibility, and accuracy, IEEE/ACM Trans. Comput. Biol. Bioinform. 2004, pp. 13-23.
19. S.R. Myers, and R.C. Griffiths Bounds on the minimum number of recombination events in a sample history Genetics 163 2003 375 394
20. L. Nakhleh, D. Ringe, T. Warnow, Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages, preprint, April 14, 2002.
21. L. Nakhleh, J. Sun, T. Warnow, C.R. Linder, B.M.E. Moret, A. Tholse, Towards the development of computational tools for evaluating phylogenetic network reconstruction methods, in: Proceedings of Eighth Pacific Symposium on Biocomputing (PSB 03), 2003, pp. 315-326.
22. L. Nakhleh, T. Warnow, C.R. Linder, Reconstructing reticulate evolution in species-theory and practice, in: Proceedings of Eighth Annual International Conference on Computational Molecular Biology, 2004, pp. 337-346.
23. M. Norborg, and S. Tavare Linkage disequilibrium what history has to tell us Trends Genet. 18 2002 83 90
24. D. Posada, and K. Crandall Intraspecific gene genealogies trees grafting into networks Trends Ecol. Evol. 16 2001 37 45
25. M.H. Schierup, and J. Hein Consequences of recombination on traditional phylogenetic analysis Genetics 156 2000 879 891
26. C. Semple, and M. Steel Phylogenetics 2003 Oxford University Press UK
27. Y. Song, and J. Hein On the minimum number of recombination events in the evolutionary history of DNA sequences J. Math. Biol. 48 2003 160 186
28. Y. Song, J. Hein, Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events, in: Proceedings of the 2003 Workshop on Algorithms in Bioinformatics, Berlin, Germany, Lecture Notes in Computer Science, Springer, Berlin, 2003.
29. L. Wang, K. Zhang, and L. Zhang Perfect phylogenetic networks with recombination J. Comput. Biol. 8 2001 69 78