Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PhyloNetwork / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: HybridNET / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2772832179 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1712.02965 / rank | |||
Normal rank | |||
Latest revision as of 22:39, 18 April 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
