Author:
Kleinman Aaron,Harel Matan,Pachter Lior
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference29 articles.
1. Bertrand P., Janowitz M.F.: Pyramids and weak hierarchies in the ordinal model for clustering. Discrete Appl. Math. 122(1-3), 55–81 (2002)
2. Booth K., Lueker G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13(3), 335–379 (1976)
3. Bryant D., Moulton V.: Neighbor-Net: an agglomerative method for the construction of phylogenetic networks. Mol. Biol. Evol. 21(2), 255–265 (2004)
4. Bryant, D., Moulton, V., Spillner, A.: Consistency of the neighbor-net algorithm. Algorithms Mol. Bio. 2, #8 (2007)
5. Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, F.R., Kendall, D.G., Tǎutu, P. (eds.)Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献