Author:
Kao Ming-Yang,Lam Tak-Wah,Sung Wing-Kin,Ting Hing-Fung
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. R. Agarwala and D. Fernández-Baca, A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed, SIAM Journal on Computing, 23 (1994), pp. 1216–1224.
2. Lect Notes Comput Sci;H. L. Bodlaender,1992
3. J. Bondy and U. Murty, Graph Theory with Applications, North-Holland, NewYork, NY, 1976.
4. M. J. Chung, O(n
2.5) time algorithms for the subgraph homeomorphism problem on trees, Journal of Algorithms, 8 (1987), pp. 106–112.
5. R. Cole and R. Hariharan, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 323–332.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献