The Tandem Duplication Distance Is NP-Hard (Q5874286)
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 Is NP-Hard |
scientific article; zbMATH DE number 7650900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Tandem Duplication Distance Is NP-Hard |
scientific article; zbMATH DE number 7650900 |
Statements
7 February 2023
0 references
tandem duplication
0 references
text processing
0 references
formal languages
0 references
computational genomics
0 references
FPT algorithms
0 references
The Tandem Duplication Distance Is NP-Hard (English)
0 references
0.97904766
0 references
0.9171427
0 references
0 references
0 references
0.82878023
0 references
0.8287802
0 references
0.82094353
0 references
0.80878127
0 references
