scientific article; zbMATH DE number 910918
From MaRDI portal
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)- Efficient computation of template matrices
- Two strikes against perfect phylogeny
- The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Minimizing phylogenetic number to find good evolutionary trees
- 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
- A novel insight into the perfect phylogeny problem
- The three-state perfect phylogeny problem reduces to 2-SAT
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny
- Generalizing the splits equivalence theorem and four gamete condition: Perfect phylogeny on three-state characters
- scientific article; zbMATH DE number 2102787 (Why is no real title available?)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
- Parameterized and Exact Computation
- On the Generalised Character Compatibility Problem for Non-branching Character Trees
- An algorithm for construction of all perfect phylogeny matrices
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)
