A polynomial time algorithm for constructing the refined Buneman tree

DOI10.1016/S0893-9659(98)00148-7zbMath0931.05077OpenAlexW2046837061MaRDI QIDQ1808975

Vincent L. Moulton, David Bryant

Publication date: 16 February 2000

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(98)00148-7

zbMATH Keywords

weighted treephylogeneticsBuneman treedistance-based tree reconstructionrefined Buneman tree

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Lagged couplings diagnose Markov chain Monte Carlo phylogenetic inference ⋮ Retractions of finite distance functions onto tree metrics ⋮ Inferring evolutionary trees with strong combinatorial evidence ⋮ A structured family of clustering and tree construction methods

Uses Software

• SplitsTree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From copair hypergraphs to median graphs with latent vertices
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Retractions of finite distance functions onto tree metrics
• Trees, taxonomy, and strongly compatible multi-state characters
• Efficient algorithms for inferring evolutionary trees