Author:
Habib Michel,Stacho Juraj
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Agarwala, R., Fernández-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM Journal of Computing 23, 1216–1224 (1994)
2. Böcker, S., Bryant, D., Dress, A.W.M., Steel, M.A.: Algorithmic aspects of tree amalgamation. Journal of Algorithms 37, 522–537 (2000)
3. Lecture Notes in Computer Science;H.L. Bodlaender,1992
4. Bonet, M.L., Linz, S., John, K.S.: The complexity of finding multiple solutions to betweenness and quartet compatibility. CoRR abs/1101.2170 (2011),
http://arxiv.org/abs/1101.2170
5. Bui-Xuan, B.M., Habib, M., Paul, C.: Competitive graph searches. Journal Theoretical Computer Science 393, 72–80 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献