Computing a smallest multi-labeled phylogenetic tree from rooted triplets

DOI10.1007/978-3-642-10631-6_121MaRDI QIDQ3652305zbMATH OpenOpenAlexFDO

Authors Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_121

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15)

Recommendations

• Resolving rooted triplet inconsistency by dissolving multigraphs
• New Results on Optimizing Rooted Triplets Consistency
• scientific article; zbMATH DE number 7564377
• New results on optimizing rooted triplets consistency
• scientific article; zbMATH DE number 6851886

Cited in

(6)

• The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
• Complexity insights of the minimum duplication problem
• The complexity of inferring a minimally resolved phylogenetic supertree
• Resolving rooted triplet inconsistency by dissolving multigraphs
• ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی
• New results on optimizing rooted triplets consistency

This page was built for publication: Computing a smallest multi-labeled phylogenetic tree from rooted triplets

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