Beyond the longest letter-duplicated subsequence problem (Q6496833)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7842468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond the longest letter-duplicated subsequence problem |
scientific article; zbMATH DE number 7842468 |
Statements
Beyond the longest letter-duplicated subsequence problem (English)
0 references
6 May 2024
0 references
segmental duplications
0 references
tandem duplications
0 references
longest common subsequence
0 references
NP-completeness
0 references
dynamic programming
0 references
