Computing the quartet distance between evolutionary trees of bounded degree

Series on Advances in Bioinformatics and Computational Biology

Volumn 5, Issue , 2007, Pages 101-110

  Stissing, M ^a   Pedersen, C N S ^a   Mailund, T ^a,c   Brodal, G S ^a   Fagerberg, R ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BIOINFORMATICS; TREES (MATHEMATICS);

BOUNDED DEGREE; EVOLUTIONARY TREE; N SPECIES; QUARTET DISTANCE; RUNNING TIME;

EVOLUTIONARY ALGORITHMS;

EID: 80053990757     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947995_0013     Document Type: Conference Paper

References (10)

1. J. Felsenstein. Inferring Phylogenies. Sinauer Associates Inc., 2004.
2. D. F. Robinson and L. R. Foulds. Comparison of weighted labelled trees. In Combinatorial mathematics, VI (Proc. 6th Austral. Conf), Lecture Notes in Mathematics, pages 119-126. Springer, 1979.
3. M. S. Waterman and T. F. Smith. On the similarity of dendrograms. Journal of Theoretical Biology, 73:789-800, 1978.
4. B. L. Allen and M. Steel. Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics, 5:1-13, 2001.
5. D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53:131-147, 1981.
6. G. Estabrook, F. McMorris, and C. Meacham. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst. Zool., 34:193-200, 1985.
7. D. Bryant, J. Tsang, P. E. Kearney, and M. Li. Computing the quartet distance between evolutionary trees. In Proceedings of the 11th Annual Symposium on Discrete Algorithms (SODA), pages 285-286, 2000.
8. M. Steel and D. Penny. Distribution of tree comparison metrics-some new results. Syst. Biol., 42(2):126-141, 1993.
9. G. S. Brodal, R. Fagerberg, and C. N. S. Pedersen. Computing the quartet distance between evolutionary trees in time O(n log n). Algorithmica, 38:377-395, 2003.
10. C. Christiansen, T. Mailund, C. N. S. Pedersen, and M. Randers. Computing the quartet distance between trees of arbitrary degree. In R. Casadio and G. Myers, editors, WABI, volume 3692 of LNCS, pages 77-88. Springer, 2005. ISBN 3-540-29008-7.