Author:
Hsieh Sun-Yuan,Huang Chao-Wen
Subject
Applied Mathematics,Computational Mathematics
Reference31 articles.
1. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions;Aho;SIAM Journal on Computing,1981
2. Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms;Amir;SIAM Journal on Computing,1997
3. Inferring evolutionary trees with strong combinatorial evidence;Berry;Theoretical Computer Science,2000
4. P. Bonizzoni, G. Della Vedova, G. Mauri, Approximating the maximum isomorphic agreement subtree is hard, in: R. Giancarlo, D. Sankoff (Eds.), Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 1848, Montréal, Canada, 2000, pp. 119–128.
5. D. Bryant, Building trees, hunting for trees, and comparing trees, PhD Thesis, University of Canterbury, Christchurch, New Zealand, 1997.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献