A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed (Q4327418)
From MaRDI portal
scientific article; zbMATH DE number 741072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed |
scientific article; zbMATH DE number 741072 |
Statements
A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed (English)
0 references
6 April 1995
0 references
character compatibility
0 references
perfect phylogeny
0 references
polynomial-time algorithm
0 references
