In-place algorithms for exact and approximate shortest unique substring problems (Q6828429)
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 6763871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | In-place algorithms for exact and approximate shortest unique substring problems |
scientific article; zbMATH DE number 6763871 |
Statements
In-place algorithms for exact and approximate shortest unique substring problems (English)
0 references
24 August 2017
0 references
string pattern matching
0 references
shortest unique substring
0 references
in-place algorithms
0 references
