Sparse suffix and LCP array: simple, direct, small, and fast
From MaRDI portal
Publication:6547927
DOI10.1007/978-3-031-55598-5_11MaRDI QIDQ6547927
Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Longest common extension
- Universal compressed text indexing
- Faster Sparse Suffix Sorting
- Linear work suffix array construction
- Radix Sorting with No Extra Space
- Simplified stable merging tasks
- Efficient randomized pattern-matching algorithms
- Three Partition Refinement Algorithms
- Selection and Sorting in the “Restore” Model
- Sparse Suffix Tree Construction in Optimal Time and Space
- Sparse Text Indexing in Small Space
- Optimal Substring Equality Queries with Applications to Sparse Text Indexing
- Optimal-Time Dictionary-Compressed Indexes
- Locally Consistent Parsing for Text Indexing in Small Space
- Polynomial hash functions are reliable
- Deterministic Sparse Suffix Sorting in the Restore Model
- Bidirectional String Anchors: A New String Sampling Mechanism
- Sparse suffix trees
This page was built for publication: Sparse suffix and LCP array: simple, direct, small, and fast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547927)
