A polynomial time algorithm for constructing the refined Buneman tree
From MaRDI portal
Publication:1808975
DOI10.1016/S0893-9659(98)00148-7zbMATH Open0931.05077OpenAlexW2046837061MaRDI QIDQ1808975FDOQ1808975
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
Recommendations
Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12)
Cites Work
- Efficient algorithms for inferring evolutionary trees
- Retractions of finite distance functions onto tree metrics
- Weak hierarchies associated with similarity measures - An additive clustering technique
- From copair hypergraphs to median graphs with latent vertices
- Trees, taxonomy, and strongly compatible multi-state characters
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- A fast algorithm for constructing trees from distance matrices
- Lagged couplings diagnose Markov chain Monte Carlo phylogenetic inference
- Inferring evolutionary trees with strong combinatorial evidence
- A structured family of clustering and tree construction methods
- 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
Uses Software
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)
