A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (Q4376199)
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 1116387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies |
scientific article; zbMATH DE number 1116387 |
Statements
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (English)
0 references
10 February 1998
0 references
evolutionary trees
0 references
perfect phylogeny
0 references
combinatorial enumeration
0 references
dynamic programming
0 references
polynomial delay algorithms
0 references
0.9863153100013732
0 references
0.8836047649383545
0 references
0.8684406876564026
0 references
0.8684406876564026
0 references
