Treewidth-Based Algorithms for the Small Parsimony Problem on Networks (Q6133866)
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: Treewidth-Based Algorithms for the Small Parsimony Problem on Networks |
scientific article; zbMATH DE number 7716292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treewidth-Based Algorithms for the Small Parsimony Problem on Networks |
scientific article; zbMATH DE number 7716292 |
Statements
24 July 2023
0 references
phylogenetics
0 references
parsimony
0 references
phylogenetic networks
0 references
parameterized complexity
0 references
dynamic programming
0 references
treewidth
0 references
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks (English)
0 references
0.8369842767715454
0 references
0.8109534978866577
0 references
0.7896073460578918
0 references
0.7793084383010864
0 references
0.7680544257164001
0 references
