New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (Q2149104)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees |
scientific article; zbMATH DE number 7549530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees |
scientific article; zbMATH DE number 7549530 |
Statements
New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (English)
0 references
28 June 2022
0 references
parameterized algorithms
0 references
phylogenetic networks
0 references
phylogenetic trees
0 references
hybridization number
0 references
0 references
0 references
0 references
0 references
0.8547824621200562
0 references
0.829460620880127
0 references
0.8283956050872803
0 references
0.8118277788162231
0 references
0.8100645542144775
0 references
