An optimal algorithm to reconstruct trees from additive distance data

DOI10.1007/BF02459968zbMath0674.92003OpenAlexW2028332892WikidataQ31152357 ScholiaQ31152357MaRDI QIDQ1121819

Jotun J. Hein

Publication date: 1989

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02459968

zbMATH Keywords

phylogenetic treesunrooted treesadditive distance dataOperational Taxonomic Unit

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (11)

Near-Linear Query Complexity for Graph Inference ⋮ On the longest path algorithm for reconstructing trees from distance matrices ⋮ Tree reconstruction from partial orders ⋮ Exact learning of multitrees and almost-trees using path queries ⋮ Unnamed Item ⋮ Reconstructing Markov processes from independent and anonymous experiments ⋮ Learning and Verifying Graphs Using Queries with a Focus on Edge Counting ⋮ Unnamed Item ⋮ Reconstruction and verification of chordal graphs with a distance oracle ⋮ The triangles method to buildX-trees from incomplete distance matrices ⋮ Maximal sub-triangulation in pre-processing phylogenetic data

Cites Work

• Comparing Trees with Pendant Vertices Labelled

This page was built for publication: An optimal algorithm to reconstruct trees from additive distance data