Computing the Tandem Duplication Distance is NP-Hard (Q5020832)
From MaRDI portal
scientific article; zbMATH DE number 7453649
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Tandem Duplication Distance is NP-Hard |
scientific article; zbMATH DE number 7453649 |
Statements
Computing the Tandem Duplication Distance is NP-Hard (English)
0 references
7 January 2022
0 references
tandem duplication
0 references
text processing
0 references
formal languages
0 references
computational genomics
0 references
FPT algorithms
0 references
