Improved fixed-parameter algorithms for minimum-flip consensus trees

DOI10.1145/2071379.2071386MaRDI QIDQ3189048zbMATH OpenOpenAlexFDO

Authors Sebastian Böcker, Q.-B. 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

consensus treefixed-parameter algorithmphylogenetics

Mathematics Subject Classification ID

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

Recommendations

• An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
• A cubic-vertex kernel for flip consensus tree
• A cubic-vertex kernel for flip consensus tree
• scientific article; zbMATH DE number 1974598
• scientific article; zbMATH DE number 2089994

Cited in

(8)

• MinMax algorithms for stabilizing consensus
• A cubic-vertex kernel for flip consensus tree
• Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
• A cubic-vertex kernel for flip consensus tree
• An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
• Improved Algorithms for Constructing Consensus Trees
• A survey of parameterized algorithms and the complexity of edge modification
• Faster algorithms for computing the R* consensus tree

This page was built for publication: Improved fixed-parameter algorithms for minimum-flip consensus trees

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