Tree reconstruction from partial orders

DOI10.1007/3-540-57155-8_265zbMath1504.68169OpenAlexW1842116918MaRDI QIDQ5060131

Sampath Kannan, Tandy J. Warnow

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_265

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Computational complexity of inferring phylogenies from dissimilarity matrices
• A fast algorithm for constructing trees from distance matrices
• An optimal algorithm to reconstruct trees from additive distance data
• The complexity of reconstructing trees from qualitative characters and subtrees
• The Complexity of Metric Realization
• Simple method for constructing phylogenetic trees from distance matrices.

This page was built for publication: Tree reconstruction from partial orders