The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms (Q930588)
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: The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms |
scientific article; zbMATH DE number 5294775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms |
scientific article; zbMATH DE number 5294775 |
Statements
The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms (English)
0 references
1 July 2008
0 references
Parameterized algorithms and complexity
0 references
Phylogenetic networks
0 references
Linguistics
0 references
0.9504748582839966
0 references
0.7742469310760498
0 references
0.7742469310760498
0 references
