An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

DOI10.1007/978-3-540-79723-4_6zbMath1142.68594OpenAlexW2163216179MaRDI QIDQ3503577

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

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_6

Mathematics Subject Classification ID

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

Related Items (1)

A survey of the algorithmic aspects of modular decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of inferring rooted phylogenies by parsimony
• Fixed-parameter tractability of graph modification problems for hereditary properties
• A supertree method for rooted trees
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Extension operations on sets of leaf-labelled trees
• Reconstruction of rooted trees from subtrees
• Efficient algorithms for inferring evolutionary trees

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