A metric for phylogenetic trees based on matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6674 LNBI, Issue , 2011, Pages 197-208

  Lin, Yu ^a   Rajan, Vaibhav ^a   Moret, Bernard M E ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING TREES; COMPUTATIONAL BIOLOGY; COMPUTATIONAL COSTS; DISTANCE MEASURE; EDIT DISTANCE; HIER-ARCHICAL CLUSTERING; NEAREST-NEIGHBORS; NP-HARD; PAIRWISE DISTANCES; PHYLOGENETIC TREES; POLYNOMIAL-TIME; ROBINSON-FOULDS DISTANCE; SIMILARITY MEASURE; STATISTICAL TESTING; SUBTREES; TREE OPERATIONS;

BIOINFORMATICS; POLYNOMIAL APPROXIMATION; STATISTICAL TESTS;

PLANT EXTRACTS;

EID: 79955863544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21260-4_21     Document Type: Conference Paper

References (20)

1. Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics 5(1), 1-15 (2001)
2. Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM J. Computing 26(6), 1656-1669 (1997)
3. Bryant, D.: Hunting for trees, building trees and comparing trees: Theory and method in phylogenetic analysis. PhD thesis, University of Canterbury (1997)
4. Bryant, D., Steel, M.: Computing the distribution of a tree metric. ACM/IEEE Trans. on Comput. Biology and Bioinformatics 6(3), 420-426 (2009)
5. Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Computing 30(5), 1385-1404 (2000)
6. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proc. 8th ACM/SIAM Symp. Discrete Algs. (SODA 1997), pp. 427-436 (1997)
7. Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classification 2(1), 7-28 (1985)
8. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248-264 (1972)
9. Farach, M., Przytycka, T.M., Thorup, M.: On the agreement of many trees. Inf. Process. Lett. 55(6), 297-301 (1995)
10. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Computing 18(5), 1013-1036 (1989)
11. Hickey, G., Dehne, F., Rau-Chaplin, A., Blouin, C.: SPR distance computation of unrooted trees. Evol. Bioinform. Online 4, 17-27 (2008)
12. Kao, M.Y.: Tree contractions and evolutionary trees. SIAM J. Computing 27(6), 1592-1616 (1998)
13. Li, M., Tromp, J., Zhang, L.: On the nearest-neighbour interchange distance between evolutionary trees. J. Theor. Biol. 182(4), 463-467 (1996)
14. Pattengale, N.D., Gottlieb, E.J., Moret, B.M.E.: Efficiently computing the Robinson-Foulds metric. J. Comput. Biol. 14(6), 724-735 (2007)
15. Pattengale, N.D., Swenson, K.M., Moret, B.M.E.: Uncovering hidden phylogenetic consensus. In: Borodovsky, M., Gogarten, J.P., Przytycka, T.M., Rajasekaran, S. (eds.) ISBRA 2010. LNCS, vol. 6053, pp. 128-139. Springer, Heidelberg (2010)
16. Robinson, D.R., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences 53, 131-147 (1981)
17. Steel, M., Penny, D.: Distributions of tree comparison metrics - some new results. Syst. Biol. 42(2), 126-141 (1993)
18. Steel, M., Warnow, T.: Kaikoura tree theorems: computing maximum agreement subtree problem. Information Processing Letters 48, 77-82 (1993)
19. Stockham, C., Wang, L.-S., Warnow, T.: Statistically-based postprocessing of phylogenetic analysis using clustering. In: Proc. 10th Conf. Intelligent Systems for Mol. Biol. (ISMB 2002). Bioinformatics, vol. 18, pp. S285-S293. Oxford U. Press, Oxford (2002)
20. Whidden, C., Zeh, N.: A unifying view on approximation and fpt of agreement forests. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 390-402. Springer, Heidelberg (2006)