Approximating subtree distances between phylogenies

Journal of Computational Biology

Volumn 13, Issue 8, 2006, Pages 1419-1434

  Bonet, Maria Luisa ^a   John, Katherine St ^b,c,f   Mahindru, Ruchi ^b,d   Amenta, Nina ^e  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

^d University Heights   (United States)

^e University of California   (United States)

^f CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Approximation algorithms; Phylogeny; SPR distance

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; METHODOLOGY; PHYLOGENY;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; MODELS, BIOLOGICAL; PHYLOGENY;

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

References (27)

1. Addario-Berry, L., Chor, B., Hallett, M., et al. 2003. Ancestral maximum likelihood of phylogenetic trees is hard. Lect. Notes Comput. Sci. 2812, 202-215.
2. Allen, B., and Steel, M. 2001. Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Combinatorics 5, 1-13.
3. Amenta, N., and Klingner, J. 2002. Case study: visualizing sets of evolutionary trees. 8th IEEE Symp. Inform. Visualization (InfoVis 2002) 71-74. Software available at: comet.lehman.cuny.edu/treeviz.
4. Baroni, M., Grunewald, S., Moulton, V., et al. 2005. Bounding the number of hybridisation events for a consistent evolutionary history. TJ. Math. Biol. 51, 171-182.
5. Bordewich, M., and Semple, C. 2005. On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combinatorics 8, 409-423.
6. Bordewich, M., and Semple, C. 2006. Computing the minimum number of hybridisation events for a consistent evolutionary history. Discrete Applied Mathematics, in press.
7. Bush, R., Bender, C., Subbarao, K., et al. 1999. Predicting the evolution of human influenza a. Science 286, 1921-1925.
8. Day, W.H.E. 1985. Optimal algorithms for comparing trees with labeled leaves. J. Classific. 2, 7-28.
9. Ding, Z., Filkov, V., and Gusfield, D. 2005. A linear-time algorithm for the perfect phylogeny haplotyping (pph) problem. RECOMB 2005 585-600.
10. Foulds, L.R., and Graham, R.L. 1982. The Steiner tree problem in phylogeny is np-complete. Adv. Appl. Math. 3, 43-49.
11. Gray, R., and Atkinson, Q. 2003. Language-tree divergence times support the Anatolian theory of Indo-European origin. Nature 426, 435-439.
12. Gusfield, D. 2004. An overview of combinatorial methods for haplotype inference. Lect. Notes Comput. Sci. 2983, 9-25.
13. Hein, J., Jiang, T., Wang, L., et al. 1996. On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153-169.
14. Hillis, D., Heath, T., and John, K.S. 2005. Analysis and visualization of tree space. J. System. Biol. 3, 471-482.
15. Hillis, D.M. 1999. Predictive evolution. Science 286, 1866-1867.
16. Hillis, D.M., Mable, B.K., and Moritz, C. 1996. Molecular Systematics. Sinauer Associates, Sunderland, MA.
17. Huelsenbeck, J.P., and Ronquist, F. 2001. Mrbayes: Bayesian inference of phylogeny. Bioinformatics 17, 754-755.
18. Maddison, W. 1997. Gene trees in species trees. Syst. Biol. 46, 523-536.
19. Munzner, T., Guimbrètiere, F., Tasiran, S., et al. 2003. TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility. SIGGRAPH 2003 Proc. (Trans. Graphics) 453-462.
20. Nakhleh, L.K., Warnow, T., Linder, C.R., et al. 2005. Reconstructing reticulate evolution in species-theory and practice. J. Comput. Biol. 12, 6-7.
21. Novitsky, V., Smith, U.R., Gilbert, P., et al. 2002. Human immunodeficiency virus type 1 subtype c molecular phylogeny: consensus sequence for an aids vaccine design? J. Virol. 76, 5435-5451.
22. Page, R., and Charleston, M. 1998. Trees within trees: phylogeny and historical associations. Trends Ecol. Evol. 13, 356-359.
23. Robinson, D., and Foulds, L. 1981. Comparison of phylogenetic trees. Math. Biosci. 53, 131-147.
24. Roch, S. 2006. A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE/ACM Trans. Comput. Biol. Bioinform. 3, 92-94.
25. Rodrigues, E.M., Sagot, M.-F., and Wakabayashi, Y. 2001. Some approximation results for the maximum agreement forest problem. Lect. Notes Comput. Sci. 2129, 159-169.
26. Swofford, D. 2002. PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4. Sinauer Associates, Sunderland, MA.
27. Warnow, T., Ringe, D., and Taylor, A. 1996. Reconstructing the evolutionary history of natural languages. Proc. ACM-SIAM Symp. Discrete Algorithms (SODA) 314-322.