A polynomial time algorithm for constructing the refined Buneman tree

Applied Mathematics Letters

Volumn 12, Issue 2, 1999, Pages 51-56

  Bryant, D ^a   Moulton, V ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b MID SWEDEN UNIVERSITY   (Sweden)

Author keywords

Buneman tree; Distance based tree reconstruction; Phylogenetics; Refined Buneman tree; Weighted trees

Indexed keywords

EID: 0008011966     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(98)00148-7     Document Type: Article

References (13)

1. J. Barthélemy, From copair hypergraphs to median graphs with latent vertices, Discrete Math. 76, 9-28 (1989).
2. A. Dress, V. Moulton and M. Steel, Trees, taxonomy and strongly compatible multi-state characters, Advances in Applied Mathematics 19, 1-30 (1997).
3. M. Nei, Relative efficiencies of different tree-making methods for molecular data, In Phylogenetic Analysis of DNA Sequences (Edited by M. Miyamoto and J. Cracraft), pp. 90-128, Oxford University Press, (1991).
4. D. Swofford, G. Olsen, P. Waddell and D. Hillis, Phylogenetic inference, In Molecular Systematics (Edited by D. Hillis, C. Moritz and B. Mable), pp. 407-514, Sinauer, Sunderland, MA, (1996).
5. V. Moulton and M. Steel, Retractions of finite distance functions onto tree metrics, Discrete Applied Mathematics (to appear).
6. V. Moulton, M. Steel and C. Tuffley, Dissimilarity maps and substitution models, In Proceedings of the DIMACS Workshop on Mathematical Hierarchies (to appear).
7. K. Wolf and P.O. Degens, On properties of additive tree algorithms, In Conceptual and Numerical Analysis of Data (Edited by O. Opitz), pp. 256-265, Springer-Verlag, (1989).
8. P. Buneman, The recovery of trees from measures of dissimilarity, In Mathematics in the Archaeological and Historical Sciences (Edited by F. Hodson, D. Kendall and P. Tautu), pp. 387-395, Edinburgh University Press, Edinburgh, (1971).
9. D. Huson, SPLITSTREE - A program for analyzing and visualizing evolutionary data, CABIOS (to appear).
10. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21, 19-28 (1991).
11. H.-J. Bandelt and A. Dress, Weak hierarchies associated with similarity measures - An additive clustering technique, Bulletin of Mathematical Biology 51 (1), 133-166 (1989).
12. V. Berry and O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, In Proceedings of the Third International Computing and Combinatorics Conference (COCOON), Shanga (Edited by T. Jiang), pp. 111-123, (1997).
13. F.R. McMorris, D.B. Meronk and D.A. Neumann, A view of some consensus methods for trees, In Numerical Taxonomy (Edited by J. Felsenstein), pp. 122-125, Springer-Verlag, (1983).