Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Bryant, D.: Hunting for trees in binary character sets. Journal of Computational Biology 3(2), (1996) 275–288.
2. Bryant, D.: Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. Ph.D. thesis, Dept. Mathematics, University of Canterbury (1997).
3. Finden, C.R. and Gordon. A.D. Obtaining common pruned trees. Journal of Classification, 2 (1986) 255–276.
4. Gordon, A.D. Consensus supertrees: the synthesis of rooted trees containing over-lapping sets of leaves. Journal of Classification, 3 (1986) 335–348.
5. Bryant, D. Fast algorithms for constructing optimal trees with respect to OLS and minimum evolution criteria. In preparation.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献