A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed (Q4327418): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q324833 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: David Fernández Baca / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 16:20, 5 March 2024
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
