论文信息 - A polynomial time algorithm for constructing the refined Buneman tree - 字舞流文

A polynomial time algorithm for constructing the refined Buneman tree

Vincent Moulton | David Bryant | V. Moulton | D. Bryant

[1] Mike A. Steel,et al. Retractions of Finite Distance Functions Onto Tree Metrics , 1999, Discret. Appl. Math..

[2] Olivier Gascuel,et al. Inferring evolutionary trees with strong combinatorial evidence , 1997, Theor. Comput. Sci..

[3] Vincent Moulton,et al. Trees, Taxonomy, and Strongly Compatible Multi-state Characters , 1997 .

[4] M. Steel,et al. Dissimilarity maps and substitution models , 1997 .

[5] Daniel H. Huson,et al. SplitsTree-a program for analyzing and visualizing evolutionary data , 1997 .

[6] M. Miyamoto,et al. Phylogenetic Analysis of DNA Sequences , 1991 .

[7] Dan Gusfield,et al. Efficient algorithms for inferring evolutionary trees , 1991, Networks.

[8] Jean-Pierre Barthélemy,et al. From copair hypergraphs to median graphs with latent vertices , 1989, Discret. Math..

[9] P. Degens,et al. On Properties of Additive Tree Algorithms , 1989 .

[10] Otto Optiz,et al. Conceptual and Numerical Analysis of Data , 1989 .

[11] A. Dress,et al. Weak hierarchies associated with similarity measures--an additive clustering technique. , 1989, Bulletin of mathematical biology.

[12] Fred R. McMorris,et al. A View of Some Consensus Methods for Trees , 1983 .

[13] D. Kendall,et al. Mathematics in the Archaeological and Historical Sciences , 1971, The Mathematical Gazette.

[14] P. Buneman. The Recovery of Trees from Measures of Dissimilarity , 1971 .