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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6528579
@@ Property / title @@
+An In-place Framework for Exact and Approximate Shortest Unique Substring Queries (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68224
@@ Property / zbMATH Open document ID: 1472.68224 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-662-48971-0_63
@@ Property / DOI: 10.1007/978-3-662-48971-0_63 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithms and Computation
@@ Property / published in: Algorithms and Computation / rank @@
+Normal rank
@@ Property / publication date @@
+January 2016Timestamp +2016-01-11T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-01-11T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 11 January 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6528579
@@ Property / zbMATH DE Number: 6528579 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2621569787
@@ Property / OpenAlex ID: W2621569787 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2259120662
@@ Property / OpenAlex ID: W2259120662 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00378
@@ Property / arXiv ID: 1512.00378 / rank @@
+Normal rank
@@ Property / cites work @@
+In-place algorithms for exact and approximate shortest unique substring problems
+Normal rank
@@ Property / cites work @@
+Shortest Unique Substrings Queries in Optimal Time
+Normal rank
@@ Property / cites work @@
+A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
+Normal rank
@@ Property / cites work @@
+Q4547749
@@ Property / cites work: Q4547749 / rank @@
+Normal rank
@@ Property / cites work @@
+Permuted Longest-Common-Prefix Array
@@ Property / cites work: Permuted Longest-Common-Prefix Array / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel External Memory Suffix Sorting
@@ Property / cites work: Parallel External Memory Suffix Sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering External Memory Induced Suffix Sorting
+Normal rank
@@ Property / cites work @@
+Inducing Suffix and LCP Arrays in External Memory
@@ Property / cites work: Inducing Suffix and LCP Arrays in External Memory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4606333
@@ Property / cites work: Q4606333 / rank @@
+Normal rank
@@ Property / cites work @@
+LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
+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	An In-place Framework for Exact and Approximate Shortest Unique Substring Queries