A fundamental decomposition theory for phylogenetic networks and incompatible characters

Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)

Volumn 3500, Issue , 2005, Pages 217-232

  Gusfield, Dan ^a   Bansal, Vikas ^b  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Ancestral Recombination Graph; Gene Conversion; Molecular Evolution; Perfect Phylogeny; Phylogenetic Networks; Recombination; SNP

Indexed keywords

CHROMOSOMES; GENE TRANSFER; GENETIC ALGORITHMS; PHYSIOLOGICAL MODELS; ALGORITHMS; EVOLUTIONARY ALGORITHMS; GENETIC ENGINEERING; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

ANCESTRAL RECOMBINATION GRAPH; GENE-CONVERSION; MOLECULAR EVOLUTION; PERFECT PHYLOGENY; PHYLOGENETIC NETWORKS; RECOMBINATION; SNP;

GENES; PHYSIOLOGICAL MODELS;

EID: 26444594969     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11415770_17     Document Type: Conference Paper

References (25)

1. V. Bafna and V. Bansal. The number of recombination events in a sample history: conflict graph and lower bounds. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:78-90, 2004.
2. A. Chakravarti. It's raining SNP's, hallelujah? Nature Genetics, 19:216-217, 1998.
3. J. Felsenstein. Inferring Phylogenies. Sinauer, Sunderland, MA., 2004.
4. D. Gusfield. Efficient algorithms for inferring evolutionary history. Networks, 21:19-28, 1991.
5. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, UK, 1997.
6. D. Gusfield. Optimal, efficient reconstruction of Root-Unknown phylogenetic networks with constrained recombination. Technical report, Department of Computer Science, University of California, Davis, CA, 2004.
7. D. Gusfield. On the decomposition optimality conjecture for phylogenetic networks. Technical report, UC Davis, Department of Computer Science, 2005.
8. D. Gusfield, S. Eddhu, and C. Langley. The fine structure of galls in phylogenetic networks. INFORMS J. on Computing, special issue on Computational Biology, 16:459-469, 2004.
9. D. Gusfield, S. Eddhu, and C. Langley. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinformatics and Computational Biology, 2(1):173-213, 2004.
10. D. Gusfield and 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.
11. J. Hein. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci, 98:185-200, 1990.
12. J. Hein. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol., 36:396-405, 1993.
13. 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.
14. J. D. Kececioglu and D. Gusfield. Reconstructing a history of recombinations from a set of sequences. Discrete Applied Math., 88:239-260, 1998.
15. B. Moret, L. Nakhleh, T. Warnow, C.R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme. Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Transactions on Computatational Biology and Bioinformatics, pages 13-23, 2004.
16. S. R. Myers and R. C. Griffiths. Bounds on the minimum number of recombination events in a sample history. Genetics, 163:375-394, 2003.
17. Simon Myers. The detection of recombination events using DNA sequence data. PhD thesis, University of Oxford, Oxford England, Department of Statistics, 2003.
18. L. Nakhleh, J. Sun, T. Warnow, C.R. Linder, B.M.E. Moret, and A. Tholse. Towards the development of computational tools for evaluating phylogenetic network reconstruction methods. In Proc. of 8'th Pacific Symposium on Biocomputing (PSB 03), pages 315-326, 2003.
19. L. Nakhleh, T. Warnow, and C.R. Linder. Reconstructing reticulate evolution in species - theory and practice. In Proc. of 8'th Annual International Conference on Computational Molecular Biology, pages 337-346, 2004.
20. D. Posada and K. Crandall. Intraspecific gene genealogies: trees grafting into networks. Trends in Ecology and Evolution, 16:37-45, 2001.
21. C. Semple and M. Steel. Phylogenetics. Oxford University Press, UK, 2003.
22. Y. Song. Personal Communication.
23. Y. Song and J. Hein. Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minmimum number of recombination events. In Proc. of 2003 Workshop on Algorithms in Bioinformatics, Berlin, Germany, 2003. Springer-Verlag LNCS.
24. Y. Song and J. Hein. On the minimum number of recombination events in the evolutionary history of DNA sequences. Journal of Mathematical Biology, 48:160-186, 2004.
25. L. Wang, K. Zhang, and L. Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8:69-78, 2001.