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

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

Volumn 2223 LNCS, Issue , 2001, Pages 731-742

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

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY BIOLOGY; EVOLUTIONARY TREE; N SPECIES; QUARTET DISTANCE; SUBTREES; SUB TREES;

BIOLOGY; COMPUTATION THEORY; TOPOLOGY; ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

EVOLUTIONARY ALGORITHMS;

EID: 35248812602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_62     Document Type: Conference Paper

References (16)

1. B. L. Allen and M. Steel. Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics, 5:1-13, 2001. 732
2. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM Journal on Computing, 26(6):1656-1669, 1997. 732
3. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, Apr. 1974. 736
4. G. S. Brodal, R. Fagerberg, C. N. S. Pedersen, and A. Östlin. The complexity of constructing evolutionary trees using experiments. In Proc. 28th International Colloquium on Automata, Languages, and Programming, volume 2076 of Lecture Notes in Computer Science, pages 140-151. Springer-Verlag, 2001. 732
5. D. Bryant, J. Tsang, P. E. Kearney, and M. Li. Computing the quartet distance between evolutionary trees. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 285-286, N. Y., Jan. 9-11 2000. ACM Press. 732, 733
6. P. Buneman. The recovery of trees from measures of dissimilairty. Mathematics in Archeological and Historial Sciences, pages 387-395, 1971. 732
7. R. F. Cohen and R. Tamassia. Dynamic expression trees. Algorithmica, 13(3):245-265, 1995. 733, 736
8. G. Estabrook, F. McMorris, and C. Meacham. Comparison of undirected phyloge-netic trees based on subtrees of four evolutionary units. Syst. Zool., 34(2):193-200, 1985. 732
9. M. Farach, S. Kannan, and T. J. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13(1/2):155-179, 1995. 732
10. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997. 731
11. A. Lingas, H. Olsson, and A. Östlin. Efficient merging, construction, and maintenance of evolutionary trees. In Proc. 26th Int. Colloquium on Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 544-553. Springer-Verlag, 1999. 732
12. D. F. Robinson and L. R. Foulds. Comparison of weighted labelled trees. In Combinatorial mathematics, VI (Proc. Sixth Austral. Conf., Univ. New England, Armidale, 1978), Lecture Notes in Mathematics, pages 119-126. Springer, Berlin, 1979. 732
13. D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Math. Biosci., 53(1-2):131-147, 1981. 732
14. M. Steel and D. Penny. Distribution of tree comparison metrics-some new results syst. Syst. Biol., 42(2):126-141, 1993. 733
15. J. Stoye and D. Gusfield. Simple and flexible detection of contiguous repeats using a suffix tree. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching, volume 1448 of Lecture Notes in Computer Science, pages 140-152. Springer-Verlag, 1998. 733
16. M. S. Waterman and T. F. Smith. On the similarity of dendrograms. Journal of Th eo reti ca l Biol ogy, 73:789-800, 1978. 732