A polynomial time algorithm for constructing the refined Buneman tree

DOI10.1016/S0893-9659(98)00148-7MaRDI QIDQ1808975zbMATH OpenOpenAlexFDO

Authors David Bryant, Vincent Moulton

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

phylogeneticsweighted treeBuneman treedistance-based tree reconstructionrefined Buneman tree

Mathematics Subject Classification ID

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

Recommendations

• A fast algorithm for constructing trees from distance matrices
• Retractions of finite distance functions onto tree metrics
• An optimal algorithm to reconstruct trees from additive distance data
• Constructing optimal trees from quartets

Cites work

• scientific article; zbMATH DE number 4201445 (Why is no real title available?)
• scientific article; zbMATH DE number 1088266 (Why is no real title available?)
• scientific article; zbMATH DE number 1113973 (Why is no real title available?)
• Efficient algorithms for inferring evolutionary trees
• From copair hypergraphs to median graphs with latent vertices
• Retractions of finite distance functions onto tree metrics
• Trees, taxonomy, and strongly compatible multi-state characters
• Weak hierarchies associated with similarity measures - An additive clustering technique

Cited in

(7)

• A fast algorithm for constructing trees from distance matrices
• Inferring evolutionary trees with strong combinatorial evidence
• A structured family of clustering and tree construction methods
• Lagged couplings diagnose Markov chain Monte Carlo phylogenetic inference
• Retractions of finite distance functions onto tree metrics
• Combining polynomial running time and fast convergence for the disk-covering method.
• The triangles method to build \(X\)-trees from incomplete distance matrices

Describes a project that uses

Uses Software

• SplitsTree

This page was built for publication: A polynomial time algorithm for constructing the refined Buneman tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808975)