Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees

DOI10.1145/2071379.2071386zbMath1295.68128OpenAlexW2089357212MaRDI QIDQ3189048

Sebastian Böcker, Q. B. A. Bui, Anke Truss

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2071379.2071386

zbMATH Keywords

phylogeneticsfixed-parameter algorithmconsensus tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Nonnumerical algorithms (68W05)

Related Items (3)

A survey of parameterized algorithms and the complexity of edge modification ⋮ Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree} ⋮ A cubic-vertex kernel for flip consensus tree

This page was built for publication: Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees