A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

Authors:
Richa Agarwala;David Fernandez-Baca
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1994

Citing 0
Cited 30

Constructing evolutionary trees in the presence of polymorphic characters

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Better methods for solving parsimony and compatibility

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing the evolutionary history of natural languages

Proceedings of the seventh 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
From Quartets to Phylogenetic Trees

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Incomplete Directed Perfect Phylogeny

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Selecting the branches for an evolutionary tree: a polynomial time approximation scheme

Journal of Algorithms
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

Theoretical Computer Science - Parameterized and exact computation
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Undirected Incomplete Perfect Phylogeny Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory

RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
On the Generalised Character Compatibility Problem for Non-branching Character Trees

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Efficiently finding the most parsimonious phylogenetic tree via linear programming

ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Generalizing the four gamete condition and splits equivalence theorem: perfect phylogeny on three state characters

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Reducing multi-state to binary perfect phylogeny with applications to missing, removable, inserted, and deleted data

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Towards a characterisation of the generalised cladistic character compatibility problem for non-branching character trees

ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Unique perfect phylogeny is NP-hard

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Constructing perfect phylogenies and proper triangulations for three-state characters

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
On a conjecture about compatibility of multi-states characters

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Efficiently solvable perfect phylogeny problems on binary and k-state data with missing values

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Near Optimal Bounds for Steiner Trees in the Hypercube

SIAM Journal on Computing
Constructing camin-sokal phylogenies via answer set programming

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the genealogy of asexual diploids

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Simple reconstruction of binary near-perfect phylogenetic trees

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Improved lower bounds on the compatibility of quartets, triplets, and multi-state characters

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Unique perfect phylogeny is intractable

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed. This solves a longstanding open problem. This result should be contrasted with the proof by Steel [J. Classification, 9(1992), pp. 91--116] and Bodlaender, Fellows, and Warnow [Proceedings of the19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 1992, pp. 273--283] that the perfect phylogeny problem is NP complete in general.