In-place algorithms for exact and approximate shortest unique substring problems (Q2399613)
From MaRDI portal
(Redirected from Item:Q3459912)
 | 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: In-place algorithms for exact and approximate shortest unique substring problems |
scientific article; zbMATH DE number 6528579
- An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | In-place algorithms for exact and approximate shortest unique substring problems |
scientific article; zbMATH DE number 6528579 |
|
Statements
In-place algorithms for exact and approximate shortest unique substring problems (English)
0 references
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries (English)
0 references
24 August 2017
0 references
11 January 2016
0 references
string pattern matching
0 references
shortest unique substring
0 references
in-place algorithms
0 references
0 references
0.9500612
0 references
0.9256949
0 references
0.92372674
0 references
0.9149656
0 references
0.8999664
0 references
0.89474905
0 references
0 references
0.88600016
0 references
