Tree Reconstruction from Partial Orders

DOI10.1137/S0097539793252195zbMath0830.05021OpenAlexW1987542209MaRDI QIDQ4842119

Sampath Kannan, Tandy J. Warnow

Publication date: 28 January 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793252195

zbMATH Keywords

polynomial time algorithmNP-hardpartial ordersdistance matrixNP- completepath distanceedge-weighted treestree reconstruction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Trees (05C05) Problems related to evolution (92D15) Combinatorics of partially ordered sets (06A07) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) General biology and biomathematics (92B05) Computational methods for problems pertaining to biology (92-08)

This page was built for publication: Tree Reconstruction from Partial Orders