Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: HybridNET / rank | |||
Normal rank |
Revision as of 10:18, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Deciding the existence of a cherry-picking sequence is hard on two trees |
scientific article |
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