Resolving rooted triplet inconsistency by dissolving multigraphs

DOI10.1007/978-3-642-38236-9_24MaRDI QIDQ4922133zbMATH OpenOpenAlexFDO

Authors Andrew Chester, Riccardo Dondi, Anthony Wirth

Publication date 28 May 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-38236-9_24

Mathematics Subject Classification ID

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

Recommendations

• New Results on Optimizing Rooted Triplets Consistency
• New results on optimizing rooted triplets consistency
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets

Cited in

(5)

• Determining the consistency of resolved triplets and fan triplets
• Complexity insights of the minimum duplication problem
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets
• Constructing a consensus phylogeny from a leaf-removal distance (extended abstract)

This page was built for publication: Resolving rooted triplet inconsistency by dissolving multigraphs

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