Author:
Daskalakis Constantinos,Hill Cameron,Jaffe Alexandar,Mihaescu Radu,Mossel Elehanan,Rao Satish
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Buneman, P.: The recovery of trees from measures of dissimilarity. In: Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)
2. Cavender, J.: Taxonomy with confidence. Mathematical Biosciences 40, 271–280 (1978)
3. Day, W.: Optimal algorithms for comparing trees with labelled leaves. J. Class. 2, 7–28 (1995)
4. Erdos, P., Steel, M., Szekely, L., Warnow, T.: A few logs suffice to build (almost) all trees (part 1). Random Structures and Algorithms 14(2), 153–184 (1999)
5. Erdos, P., Steel, M., Szekely, L., Warnow, T.: A few logs suffice to build (almost) all trees (part 2). Theoretical Computer Science 221, 77–118 (1999)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献