The complexity of inferring a minimally resolved phylogenetic supertree

DOI10.1137/100811489MaRDI QIDQ2884583zbMATH OpenOpenAlexFDO

Authors Jesper Jansson, Richard S. Lemence, 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

phylogenetic treegraph coloringNP-hardnessrooted tripletminimally resolved supertreetree separator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6851886
• scientific article; zbMATH DE number 7564377
• Reconstructing minimal rooted trees.
• A supertree method for rooted trees
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets

Cited in

(8)

• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
• Indirect identification of horizontal gene transfer
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
• The Complexity of Rooted Phylogeny Problems
• scientific article; zbMATH DE number 6851886 (Why is no real title available?)
• Reconstructing minimal rooted trees.
• Building a small and informative phylogenetic supertree
• scientific article; zbMATH DE number 7564377 (Why is no real title available?)

This page was built for publication: The complexity of inferring a minimally resolved phylogenetic supertree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884583)