In-place algorithms for exact and approximate shortest unique substring problems (Q2399613)

From MaRDI portal
Revision as of 09:57, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q3459912)
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
  • An In-place Framework for Exact and Approximate Shortest Unique Substring Queries

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
0 references
0 references
0 references
0 references
0 references
24 August 2017
0 references
11 January 2016
0 references
0 references
0 references
string pattern matching
0 references
shortest unique substring
0 references
in-place algorithms
0 references
0 references
0 references
0 references