TreeCmp: Comparison of trees in polynomial time

Evolutionary Bioinformatics

Volumn 2012, Issue 8, 2012, Pages 475-487

  Bogdanowicz, Damian ^a   Giaro, Krzysztof ^a   Wróbel, Borys ^b,c  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^b INSTITUTE OF OCEANOLOGY   (Poland)

^c ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Matching Cluster metric; Matching Split metric; Phylogenetics; Tree comparison; Tree metrics

Indexed keywords

ACCESS TO INFORMATION; ACCURACY; COMPARATIVE STUDY; COMPUTER INTERFACE; COMPUTER PROGRAM; INTERNET; MATHEMATICAL ANALYSIS; PHYLOGENETIC TREE; PHYLOGENETIC TREE CONSTRUCTION METHOD; REVIEW;

EID: 84864835922     PISSN: None     EISSN: 11769343     Source Type: Journal    
DOI: 10.4137/EBO.S9657     Document Type: Review

References (36)

1. Price MN, Dehal PS, Arkin AP. FastTree 2-Approximately Maximum-Likelihood trees for large alignments. PLoS One. 2010;5:e9490.
2. Sul, S-J, Matthews S, Williams T. Using tree diversity to compare phylogenetic heuristics. BMC Bioinformatics. 2009;10(Suppl 4):S3.
3. Wang JTL, Shan H, D. Shasha D, Piel WH. Fast structural search in phylogenetic databases. Evol Bioinform. 2005;1:37-46.
4. Bogdanowicz D, Giaro K. Matching Split distance for unrooted binary phylogenetic trees. IEEE/ACM Trans Comput Biol Bioinform. 2012;9:150-60.
5. Robinson DF, Foulds LR. Comparison of phylogenetic trees. Math Biosci. 1981;53:131-47.
6. Steel MA, Penny D. Distributions of tree comparison metrics-some new results. Syst Biol. 1993;42:126-41.
7. Cardona G, Llabrés M, Rosselló F, Valiente G. Nodal distances for rooted phylogenetic trees. J Math Biol. 2010;61:253-76.
8. Critchlow DE, Pearl DK, Qian C. The Triples Distance for rooted bifurcating phylogenetic trees. Syst Biol. 1996;45:323-34.
9. Estabrook GF, McMorris FR, Meacham CA. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst Biol. 1985;34:193-200.
10. DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L. On computing the nearest neighbor interchange distance, In: Proceedings of the DIMACS Workshop on Discrete Problems with Medical Applications: 1997:125-43.
11. Hickey G, Dehne F, Rau-Chaplin A, Blouin C. SPR distance computation for unrooted trees. Evol Bioinform. 2008;4:17-27.
12. Allen BL, Steel M. Subtree transfer operations and their induced metrics on evolutionary trees. Ann Comb. 2001;5:1-15.
13. Gabow HN, Tarjan RE. Faster scaling algorithms for network problems. SIAM J Comp. 1989;18:1013-36.
14. Orlin JB, Ahuja RK. New scaling algorithms for the assignment and minimum mean cycle problems. Math Program. 1992;54:41-56.
15. Jonker R, Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing. 1987;38:325-40.
16. Dell'Amico M, Toth P. Algorithms and codes for dense assignment problems: the state of the art. Discrete Appl Math. 2000;100:17-48.
17. Day WHE. Optimal algorithms for comparing trees with labeled leaves. J Classif. 1985;2:7-28.
18. Brodal GS, Fagerberg R, Pedersen CNS. Computing the Quartet Distance between evolutionary trees in time O(n log n), Algorithmica. 2003;38: 377-95.
19. Nielsen J, Kristensen AK, Mailund T, Pedersen CNS. A sub-cubic time algorithm for computing the quartet distance between two general trees. Algorithms Mol Biol. 2011;6:15.
20. Christiansen C, Mailund T, Pedersen CNS, Randers M, Stissing MS. Fast calculation of the quartet distance between trees of arbitrary degrees. Algorithms Mol Biol. 2006;1:16.
21. Bansal MS, Dong J, Fernández-Baca D. Comparing and aggregating partially resolved trees. Theor Comput Sci. 2011;412:6634-52.
22. McKenzie A, Steel M. Distributions of cherries for two models of trees. Math Biosci. 2000;164:81-92.
23. Stamatakis A. RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics. 2006;22:2688-90.
24. Guindon S, Delsuc F, Dufayard J-F, Gascuel O. Estimating maximum likelihood phylogenies with PhyML. Methods Mol Biol. 2009;537:113-37.
25. Guindon S, Dufayard J-F, Lefort V, Anisimova M, Hordijk W, Gascuel O. New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0. Syst Biol. 2010;59:307-21.
26. Gascuel O. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol Biol Evol. 1997;14:685-95.
27. Felsenstein J. PHYLIP-Phylogeny Inference Package (Version 3.2). Cladistics. 1989;5:164-6.
28. Desper R, Gascuel O. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. J Comput Biol. 2002;9: 687-705.
29. Saitou N, Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol. 1987;4:406-25.
30. Evans J, Sheneman L, Foster J. Relaxed neighbor joining: a fast distancebased phylogenetic tree construction method. J Mol Evol. 2006;62:785-92.
31. Jones DT, Taylor WR, Thornton JM. The rapid generation of mutation data matrices from protein sequences. Comput Appl Biosci. 1992;8:275-82.
32. de Vienne DM, Giraud T, Martin OC. A congruence index for testing topological similarity between trees. Bioinformatics. 2007;23:3119-24.
33. Munzner T, Guimbretière F, Tasiran S, Zhang L, Zhou Y. TreeJuxtaposer: scalable tree comparison using FocusaContext with guaranteed visibility. ACM Trans Graph. 2003;22:453-62.
34. Drummond A, Strimmer K. PAL: an object-oriented programming library for molecular evolution and phylogenetics. Bioinformatics. 2001;17:662-3.
35. Slowinski JB. Review of the computer program Component. Cladistics. 1993;9:351-3.
36. Puigbò P, Garcia-Vallvé S, McInerney JO. TOPD/FMTS: a new software to compare phylogenetic trees. Bioinformatics. 2007;23:1556-8.