In-place algorithms for exact and approximate shortest unique substring problems (Q2399613): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Merged Item from Q3459912
 
(3 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
description / endescription / en
scientific article
scientific article; zbMATH DE number 6528579
Property / title
 
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries (English)
Property / title: An In-place Framework for Exact and Approximate Shortest Unique Substring Queries (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1472.68224 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-48971-0_63 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
11 January 2016
Timestamp+2016-01-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 January 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6528579 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2621569787 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2259120662 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.00378 / rank
 
Normal rank

Latest revision as of 09:57, 6 May 2024

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