The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree

DOI10.1137/100811489zbMath1242.68115OpenAlexW2041328910MaRDI QIDQ2884583

Richard S. Lemence, Jesper Jansson, Andrzej Lingas

Publication date: 30 May 2012

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

Full work available at URL: https://semanticscholar.org/paper/42ae6b86f5e2921b55e55a795d70c07df9d14a81

zbMATH Keywords

graph coloringNP-hardnessphylogenetic treerooted tripletminimally resolved supertreetree separator

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Building a small and informative phylogenetic supertree ⋮ The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets ⋮ Unnamed Item ⋮ Indirect identification of horizontal gene transfer

This page was built for publication: The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree