Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Computing the local consensus of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Recovering branches on the tree of life: an approximation algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing the quartet distance between evolutionary trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A supertree method for rooted trees
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Parameterized Complexity
An improved fixed-parameter algorithm for minimum-flip consensus trees
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact ILP solutions for phylogenetic minimum flip problems
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Polynomial supertree methods revisited
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
Clustering with relative constraints
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
FlipCut supertrees: towards matrix representation accuracy in polynomial time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
ACM Transactions on Algorithms (TALG)
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
The input to a supertree problem is a collection of phylogenetic trees that intersect pairwise in their leaf sets; the goal is to construct a single tree that retains as much as possible of the information in the input. This task is complicated by inconsistencies due to errors. We consider the case where the input trees are rooted and are represented by the clusters they exhibit. The problem is to find the minimum number of flips needed to resolve all inconsistencies, where each flip moves a taxon into or out of a cluster. We prove that the minimum-flip problem is {\cal NP}{\hbox{-}}{\rm complete}, but show that it is fixed-parameter tractable and give approximation algorithms for special cases.