Computing the quartet distance between evolutionary trees in time O(n log n)

Algorithmica (New York)

Volumn 38, Issue 2, 2003, Pages 377-395

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^a   Pedersen, Christian N S ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Distance measures; Evolutionary trees; Hierarchical decompositions; Quartet distance

Indexed keywords

COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; HIERARCHICAL SYSTEMS; INFORMATION ANALYSIS; SET THEORY; TIME SERIES ANALYSIS; TOPOLOGY;

DISTANCE MEASURES; EVOLUTIONARY TREES; HIERARCHICAL DECOMPOSITIONS; QUARTET DISTANCE;

TREES (MATHEMATICS);

EID: 15244342170     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1065-y     Document Type: Conference Paper

References (19)

1. B. L. Allen and M. Steel. Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics, 5:1-13, 2001.
2. R. P. Brent, The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, 1974.
3. 2 n). In Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC), volume 2223 of Lecture Notes in Computer Science, pages 731-742. Springer-Verlag, Berlin, 2001.
4. G. S. Brodai, R. Fagerberg, C. N. S. Pedersen, and A. Östlin. The complexity of constructing evolutionary trees using experiments. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 140-151. Springer-Verlag, Berlin, 2001.
5. G. S. Brodai and C. N. S. Pedersen. Finding maximal quasiperiodicities in strings. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 1848 of Lecture Notes in Computer Science, pages 397-411. Springer-Verlag, Berlin, 2000.
6. D. Bryant, J. Tsang, P. E. Kearney, and M. Li. Computing the quartet distance between evolutionary trees. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 285-286, 2000.
7. P. Buneman. The recovery of trees from measures of dissimilairty. Mathematics in Archeological and Historial Sciences, pages 387-395, 1971.
8. R. F. Cohen and R. Tamassia. Dynamic expression trees. Algorithmica, 13(3):245-265, 1995.
9. G. Estabrook, F. McMorris, and C. Meacham. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Systematic Zoology, 34(2): 193-200, 1985.
10. M. Farach, S. Kannan, and T. J. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13(1/2):155-179, 1995.
11. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, 1997.
12. S. K. Kannan, E. L. Lawler, and T. J. Warnow. Determining the evolutionary tree using experiments. Journal of Algorithms, 21(1):26-50, July 1996.
13. A. Lingas, H. Olsson, and A. Östlin. Efficient merging, construction, and maintenance of evolutionary trees. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of Lecture Notes in Computer Science, pages 544-553. Springer-Verlag, Berlin, 1999.
14. K. Mehlhorn. Sorting and Searching, volume I of Data Structures and Algorithms. Springer-Verlag, Berlin, 1984.
15. J. Pearl and M. Tarski. Structuring causal trees. Journal of Complexity, 2:60-77, 1986.
16. D. F.Robinson and L.R. Foulds. Comparison of weighted labelled trees. In Combinatorial Mathematics, VI (Proceedings of the 6th Australian Conference, University of New England, Armidale, 1978), Lecture Notes in Mathematics, pages 119-126. Springer-Verlag, Berlin, 1979.
17. D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53(1-2):131-147, 1981.
18. M. Steel and D. Penny. Distribution of tree comparison metrics-some new results. Systematic Biology, 42(2):126-141, 1993.
19. M. S. Waterman and T. F. Smith. On the similarity of dendrograms. Journal of Theoretical Biology, 73:789-800, 1978.