In-place algorithms for exact and approximate shortest unique substring problems (Q2399613): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:39, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | In-place algorithms for exact and approximate shortest unique substring problems |
scientific article |
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
