Finding a set of long common substrings with repeats from \(m\) input strings (Q6897290)
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 8124313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a set of long common substrings with repeats from \(m\) input strings |
scientific article; zbMATH DE number 8124313 |
Statements
Finding a set of long common substrings with repeats from \(m\) input strings (English)
0 references
20 November 2025
0 references
dynamic programming
0 references
algorithm
0 references
common substrings
0 references
string
0 references
