Author:
Berry V.,Peng Z. S.,Ting H. F.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference18 articles.
1. Amenta, K., Clarke, F.: A linear-time majority tree algorithm. In: Proceedings of the 3rd International Workshop on Algorithms in Bioinformatics, pp. 216–227 (2003)
2. Berger-Wolf, T.Y.: Online consensus and agreement of phylogenetic trees. In: Proceedings of the 4th International Workshop on Algorithms in Bioinformatics, pp. 350–361 (2004)
3. Cole, R., Farach, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(nlog n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput. 30(5), 1385–1404 (2000)
4. Dong, S., Kraemer, E.: Calculation, visualization and manipulation of MASTs (maximum agreement subtrees). In: Proceedings of the IEEE Computational Systems Bioinformatics Conference, pp. 1–10 (2004)
5. Farach, M., Thorup, M.: Optimal evolutionary tree comparison by sparse dynamic programming. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 770–779 (1994)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum Compatible Tree;Encyclopedia of Algorithms;2016
2. Maximum Compatible Tree;Encyclopedia of Algorithms;2015
3. Maximum Compatible Tree;Encyclopedia of Algorithms;2008