Approximating geodesic tree distance

Information Processing Letters

Volumn 103, Issue 2, 2007, Pages 61-65

  Amenta, Nina ^a   Godwin, Matthew ^a   Postarnakevich, Nicolay ^a   St John, Katherine ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Analysis of algorithms; Phylogeny; Tree metric

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GEODESY; STATISTICAL METHODS;

ANALYSIS OF ALGORITHMS; LINEAR TIME; PHYLOGENY; TREE METRICS;

TREES (MATHEMATICS);

EID: 34247466893     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.02.008     Document Type: Article

References (13)

1. Allen B.L., and Steel M. Subtree transfer operations and their induced metrics on evolutionary trees. Ann. of Combin. 5 1 (2001) 1-15
2. Amenta N., Clarke F., and St. John K. A linear-time majority tree. Third International Workshop WABI 2003 (Workshop on Algorithms in Biology), Budapest, Hungary. Lecture Notes in Bioinformatics (subseries of Lecture Notes in Computer Science) vol. 2812 (2003), Springer 216-227
3. N. Amenta, J. Klingner, Case study: Visualizing sets of evolutionary trees, in: 8th IEEE Symposium on Information Visualization (InfoVis 2002), 2002, pp. 71-74. Software available at comet.lehman.cuny.edu/treeviz
4. Billera L.J., Holmes S.P., and Vogtmann K. Geometry of the space of phylogenetic trees. Adv. Appl. Math. 27 (2001) 733-767
5. Bordewich M., and Semple C. On the computational complexity of the rooted subtree prune and regraft distance. Ann. of Combin. 8 (2005) 409-423
6. D. Bryant, Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis, PhD thesis, Dept. of Mathematics, University of Canterbury, 1997
7. DasGupta B., He X., Jiang T., Li M., Tromp J., and Zhang L. On computing the nearest neighbor interchange distance. In: Du D.Z., Pardalos P.M., and Wang J. (Eds). Proceedings of the DIMACS Workshop on Discrete Problems with Medical Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 55 (2000), American Mathematical Society 125-143
8. Day W.H.E. Optimal algorithms for comparing trees with labeled leaves. J. Classification 2 1 (1985) 7-28
9. Hillis D.M., Mable B.K., and Moritz C. Molecular Systematics (1996), Sinauer Assoc., Sunderland, MA
10. J.P. Huelsenbeck, F. Ronquist, MrBayes: Bayesian inference of phylogeny, 2001
11. Nixon K.C. The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics 15 (1999) 407
12. C. Stockham, L.-S. Wang, T. Warnow, Statistically based postprocessing of phylogenetic analysis by clustering, in: Proceedings of 10th Internat. Conf. on Intelligent Systems for Molecular Biology (ISMB'02), Edmonton, Canada, 2002, pp. 285-293
13. Swofford D.L. PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4 (2002), Sinauer Associates, Sunderland, MA