The tandem duplication distance problem is hard over bounded alphabets (Q2115851)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The tandem duplication distance problem is hard over bounded alphabets |
scientific article |
Statements
The tandem duplication distance problem is hard over bounded alphabets (English)
0 references
22 March 2022
0 references
