Author:
Lam T. W.,Sung W. K.,Ting H. F.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. R. Agarwala and D. Fernandez-Baca, A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed, FOCS, 140–147, 1993.
2. H. Bodlaender, M. Fellows and T. Warnow, Two strikes against perfect phylogeny, ICALP, 273–283, 1992.
3. R. Cole and R. Hariharan, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, SODA, 323–332, 1996.
4. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bulletin of Mathematical Biology, 49(4):461–467, 1987.
5. M. Farach and M. Thorup, Fast comparison of evolutionary trees, SODA, 481–488, 1994.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献