A Polynomial-Time Algorithm for Near-Perfect Phylogeny (Q4429677)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1986346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial-Time Algorithm for Near-Perfect Phylogeny |
scientific article; zbMATH DE number 1986346 |
Statements
A Polynomial-Time Algorithm for Near-Perfect Phylogeny (English)
0 references
28 September 2003
0 references
algorithms
0 references
computational biology
0 references
character-based methods
0 references
evolutionary trees
0 references
parsimony
0 references
perfect phylogeny
0 references
phylogeny
0 references
Steiner tree
0 references
0.8565005660057068
0 references
0.8554138541221619
0 references
0.8391942381858826
0 references
