Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference17 articles.
1. R. Agarwala, V. Bafna, M. Farach, M. Paterson, M. Thorup, On the approximability of numerical taxonomy (fitting distances by tree metrics), SIAM J. Comput. 28(3) (1999) 1073–1085.
2. A. Ambainis, R. Desper, M. Farach, S. Kannan, Nearly tight bounds on the learnability of evolution, in: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, IEEE Press, New York, 1997, pp. 524–533.
3. K. Atteson, The performance of neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25(2–3) (1999) 251–278.
4. A canonical decomposition theory for metrics on a finite set;Bandelt;Adv. Math.,1992
5. V. Berry, O. Gasquel, Infering evolutionary trees with strong combinatorial evidence, in: COCOON’97, Lecture Notes in Computer Science, Vol. 1276, Springer-Verlag, Berlin, 1997, pp. 387–395.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献