New Results on Optimizing Rooted Triplets Consistency

DOI10.1007/978-3-540-92182-0_44zbMATH Open1183.92064OpenAlexW2732808019MaRDI QIDQ3596743FDOQ3596743

Authors: Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson 

Publication date: 29 January 2009

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

Full work available at URL: https://infoscience.epfl.ch/record/140352/files/51c.pdf

Recommendations

• New results on optimizing rooted triplets consistency
• 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
• scientific article; zbMATH DE number 7564377
• New heuristics for rooted triplet consistency

Mathematics Subject Classification ID

Problems related to evolution (92D15) Approximation algorithms (68W25)

Cited In (11)

• Kernel and fast algorithm for dense triplet inconsistency
• New results on optimizing rooted triplets consistency
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
• New heuristics for rooted triplet consistency
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
• Constructing the maximum consensus tree from rooted Triples
• Reconstructing minimal rooted trees.
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets
• Deciding the closure of inconsistent rooted triples is NP-complete
• Resolving rooted triplet inconsistency by dissolving multigraphs

This page was built for publication: New Results on Optimizing Rooted Triplets Consistency

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