Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)-Reference-Cited by-同舟云学术

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)

Published:2001 Issue: Volume: Page:731-742
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45678-3_62

Reference16 articles.

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. 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.

3. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201–206, Apr. 1974.

4. Lect Notes Comput Sci;G. S. Brodal,2001

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.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12

2. Computing quartet distance is equivalent to counting 4-cycles;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23

3. New Gromov-Inspired Metrics on Phylogenetic Tree Space;Bulletin of Mathematical Biology;2018-01-02

4. A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees;Bioinformatics Research and Applications;2012

5. Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome;Algorithms and Computation;2003