A decomposition theory for phylogenetic networks and incompatible characters

Journal of Computational Biology

Volumn 14, Issue 10, 2007, Pages 1247-1272

  Gusfield, Dan ^a,c   Bansal, Vikas ^b   Bafna, Vineet ^b   Song, Yun S ^a,c  

^a Davis   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

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

Indexed keywords

ALGORITHM; ARTICLE; DECOMPOSITION THEORY; GENETIC INCOMPATIBILITY; GENETIC RECOMBINATION; MOLECULAR EVOLUTION; PHYLOGENY; PRIORITY JOURNAL; SINGLE NUCLEOTIDE POLYMORPHISM; THEORY;

ALGORITHMS; DATABASES, GENETIC; MODELS, GENETIC; PHYLOGENY;

EID: 37049023841     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.0137     Document Type: Article

References (48)

1. Bafna, V., and Bansal, V. 2004. The number of recombination events in a sample history: conflict graph and lower bounds. IEEE/ACM Trans. Comput. Biol. Bioinform. 1, 78-90.
2. Bafna, V., and Bansal, V. 2006a. Inference about recombination from haplotype data: lower bounds and recombination hotspots. J. Comput. Biol. 13, 501-521.
3. Bafna, V., and Bansal, V. 2006b. Unpublished manuscript.
4. Bandelt, H.J., Foster, P., Sykes, B., et al. 1995. Mitochondrial portaits of human populations using median networks. Genetics 141, 743-753.
5. Chakravarti, A. 1998. It's raining SNP's, hallelujah? Nat. Genet. 19, 216-217.
6. Clark, A.G. 2003. Finding genes underlying risk of complex disease by linkage disequilibrium mapping. Curr. Opin. Genet. Devel. 13, 296-302.
7. Felsenstein, J. 2004. Inferring Phylogenies. Sinauer Associates, Sunderland, MA.
8. Griffiths, R.C., and Marjoram, P. 1996. Ancestral inference from samples of DNA sequences with recombination. J. Comput. Biol. 3, 479-502.
9. Gusfield, D. 1991. Efficient algorithms for inferring evolutionary history. Networks 21, 19-28.
10. Gusfield, D. 1997. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, UK.
11. Gusfield, D. 2005a. Optimal, efficient reconstruction of Root-Unknown phylogenetic networks with constrained and structured recombination. JCSS 70, 381-398.
12. Gusfield, D. 2005b. On the decomposition optimality conjecture for phylogenetic networks [Technical report]. University of California, Davis, CA.
13. Gusfield, D., and Bansal, V. 2005. A fundamental decomposition theory for phylogenetic networks and incompatible characters. Lect. Notes Bionform. 3500, 217-232.
14. Gusfield, D., Eddhu, S., and Langley, C. 2004a. The fine structure of galls in phylogenetic networks. INFORMS J. Comput. 16, 459-469.
15. Gusfield, D., Eddhu, S., and Langley, C. 2004b. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2, 173-213.
16. Gusfield,D., Hickerson,D., and Eddhu, S. 2007.An efficiently-computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study. Discrete Appl. Math. 155, 806-830.
17. Hein, J. 1990. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185-200.
18. Hein, J. 1993. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396-405.
19. Hein, J., Schierup, M., and Wiuf, C. 2005. Gene Genealogies, Variation and Evolution: A Primer in Coalescent Theory. Oxford University Press, Oxford, UK.
20. Hinds, D., Stuve, L., Nilsen, G., et al. 2005. Whole-genome patterns of common DNA variation in three human populations. Science 307, 1072-1079.
21. Hudson, R. 2002. Generating samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics 18, 337-338.
22. Hudson, R., and Kaplan, N. 1985. Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics 111, 147-164.
23. Huson, D., and Klopper, T. 2007. Beyond galled trees - decomposition and computation of galled networks. Lect. Notes Bioform. 4453, 211-225.
24. Huson, D., Klopper, T., Lockhart, P., et al. 2005. Reconstruction of reticulate networks from gene trees. Lect. Notes Bioinform. 3500, 233-249.
25. Kececioglu, J.D., and Gusfield, D. 1998. Reconstructing a history of recombinations from a set of sequences. Discrete Appl. Math. 88, 239-260.
26. Lyngso, R., Song, Y., and Hein, J. 2005. Minimum recombination histories by branch and bound. Lect. Notes Comput. Sci. 3692, 239-250.
27. Minichiello, M., and Durbin, R. 2006. Mapping trait loci using inferred ancestral recombination graphs. Am. J. Hum. Genet. 79, 910-922.
28. Moret, B., Nakhleh, L., Warnow, T., et al. 2004. Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE/ACM Trans. Comput. Biol. Bioinform. 13-23.
29. Morrison, D. 2005. Networks in phylogenetic analysis: new tools for population biology. Int. J. Parasitol. 35, 567-582.
30. Myers, S. 2003. The detection of recombination events using DNA sequence data [Ph.D. dissertation]. University of Oxford, Oxford, UK.
31. Myers, S.R., and Griffiths, R.C. 2003. Bounds on the minimum number of recombination events in a sample history. Genetics 163, 375-394.
32. Nakhleh, L., Sun, J., Warnow, T., et al. 2003. Towards the development of computational tools for evaluating phylogenetic network reconstruction methods. Proc. 8th Pacific Symp. Biocomput. 315-326.
33. Nakhleh, L., Warnow, T., and Linder, C. 2004. Reconstructing reticulate evolution in species - theory and practice. Proc. 8th Annu. Int. Conf. Comput. Mol. Biol. 337-346.
34. Norborg, M., and Tavare, S. 2002. Linkage disequilibrium: what history has to tell us. Trends Genet. 18, 83-90.
35. Posada, D., and Crandall, K. 2001. Intraspecific gene genealogies: trees grafting into networks. Trends Ecol. Evol. 16, 37-45.
36. Semple, C., and Steel, M. 2003. Phylogenetics. Oxford University Press, Oxford, UK.
37. Song, Y.S. 2006a. Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees. Ann. Combin. 10, 129-146.
38. Song, Y. 2006b. A concise necessary and sufficient condition for the existence of a galled-tree. IEEE/ACM Trans. Comput. Biol. Bioinform. 3, 186-191.
39. Song, Y.S., and Hein, J. 2003. Parsimonious reconstruction of sequence evolution and haplotype blocks: finding the minimum number of recombination events. In G. Benson and R. Page (eds.): Proceedings of the Third Workshop on Algorithms in Bioinformatics, LNBI, Springer-Verlag, 2812, 287-302.
40. Song, Y.S., and Hein, J. 2004. On the minimum number of recombination events in the evolutionary history of DNA sequences. J. Math. Biol. 48, 160-186.
41. Song, Y.S., and Hein, J. 2005. Constructing minimal ancestral recombination graphs. J. Comput. Biol. 12, 147-169.
42. Song, Y.S., Wu, Y., and Gusfield, D. 2005. Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics 21, i413-i422.
43. Song, Y.S., Ding, Z., Gusfield, D., et al. 2006. Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations. Lect. Notes Bioinform. 3909, 231-245.
44. Steel, M. 2005. Personal communication.
45. Wang, L., Zhang, K., and Zhang, L. 2001. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8, 69-78.
46. Wu, Y. 2005. Personal communication.
47. Wu, Y. 2007. Association mapping of complex diseases with ancestral recombination graphs: models and efficient algorithms. Lect. Notes Bioinform. 4453, 488-502.
48. Zollner, S., and Pritchard, J. 2005. Coalescent-based association mapping and fine mapping of complex trait loci. Genetics 169, 1071-1092.