Author:
Brown Daniel G.,Truszkowski Jakub
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Brodal, G.S., Fagerberg, R., Pedersen, C.N.S.: Computing the quartet distance between evolutionary trees in time O(n log n). Algorithmica 38(2), 377–395 (2003)
2. Lecture Notes in Computer Science;D.G. Brown,2011
3. Bryant, D., Tsang, J., Kearney, P.E., Li, M.: Computing the quartet distance between evolutionary trees. In: Proceedings of SODA 2000, pp. 285–286 (2000)
4. Csűrös, M.: Fast recovery of evolutionary trees with thousands of nodes. J. Comp. Biol. 9(2), 277–297 (2002)
5. Lecture Notes in Computer Science;C. Daskalakis,2009
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献