On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091): 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 17:53, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing the temporal hybridization number for two phylogenies |
scientific article |
Statements
On the complexity of computing the temporal hybridization number for two phylogenies (English)
0 references
25 April 2013
0 references
agreement forest
0 references
APX-hard
0 references
phylogenetic network
0 references
phylogenetic tree
0 references
temporal network
0 references
