scientific article; zbMATH DE number 910918
From MaRDI portal
zbMATH Open0846.92018MaRDI QIDQ4886095FDOQ4886095
Authors: Sampath Kannan, Tandy J. Warnow 
Publication date: 30 September 1996
Title of this publication is not available (Why is that?)
Recommendations
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- Hypothesis testing in perfect phylogeny for a bounded number of characters
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
- Incomplete Directed Perfect Phylogeny
- Two strikes against perfect phylogeny
Cited In (16)
- Parameterized and Exact Computation
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- On the Generalised Character Compatibility Problem for Non-branching Character Trees
- Minimizing phylogenetic number to find good evolutionary trees
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
- The three-state perfect phylogeny problem reduces to 2-SAT
- A novel insight into the perfect phylogeny problem
- The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
- Efficient computation of template matrices
- Generalizing the splits equivalence theorem and four gamete condition: Perfect phylogeny on three-state characters
- An algorithm for construction of all perfect phylogeny matrices
- Title not available (Why is that?)
- Two strikes against perfect phylogeny
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886095)
