Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507)
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: Deciding the existence of a cherry-picking sequence is hard on two trees |
scientific article; zbMATH DE number 7050995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding the existence of a cherry-picking sequence is hard on two trees |
scientific article; zbMATH DE number 7050995 |
Statements
Deciding the existence of a cherry-picking sequence is hard on two trees (English)
0 references
3 May 2019
0 references
phylogenetics
0 references
NP-hardness
0 references
satisfiability
0 references
phylogenetic networks
0 references
elimination orders
0 references
temporal networks
0 references
0 references
0.9135429859161376
0 references
0.8661087155342102
0 references
0.8297492265701294
0 references
0.7888442277908325
0 references
0.7800964117050171
0 references
