A polynomial time algorithm for constructing the refined Buneman tree
- 23 February 1999
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 12 (2) , 51-56
- https://doi.org/10.1016/s0893-9659(98)00148-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Retractions of finite distance functions onto tree metricsDiscrete Applied Mathematics, 1999
- Trees, Taxonomy, and Strongly Compatible Multi-state CharactersAdvances in Applied Mathematics, 1997
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- From copair hypergraphs to median graphs with latent verticesDiscrete Mathematics, 1989