The tandem duplication distance problem is hard over bounded alphabets (Q2115851)
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 tandem duplication distance problem is hard over bounded alphabets |
scientific article; zbMATH DE number 7495022
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The tandem duplication distance problem is hard over bounded alphabets |
scientific article; zbMATH DE number 7495022 |
Statements
The tandem duplication distance problem is hard over bounded alphabets (English)
0 references
22 March 2022
0 references
