In-place algorithms for exact and approximate shortest unique substring problems (Q2399613): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(One intermediate revision by one other user not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries | |||||||||||||||
description / en | description / en | ||||||||||||||
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
| |||||||||||||||
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: W2259120662 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: In-place algorithms for exact and approximate shortest unique substring problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Shortest Unique Substrings Queries in Optimal Time / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A simple yet time-optimal and linear-space algorithm for shortest unique substring queries / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4547749 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Permuted Longest-Common-Prefix Array / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Fast Pattern Matching in Strings / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Parallel External Memory Suffix Sorting / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Engineering External Memory Induced Suffix Sorting / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Inducing Suffix and LCP Arrays in External Memory / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Faster External Memory LCP Array Construction / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os / rank | |||||||||||||||
Normal rank |
Latest revision as of 08:02, 14 July 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 |
|
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