Sparse suffix and LCP array: simple, direct, small, and fast
From MaRDI portal
Cites work
- Backyard cuckoo hashing: constant worst-case operations with a succinct representation
- Bidirectional String Anchors: A New String Sampling Mechanism
- Construction of sparse suffix trees and LCE indexes in optimal time and space
- Deterministic Sparse Suffix Sorting in the Restore Model
- Efficient randomized pattern-matching algorithms
- Faster sparse suffix sorting
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 7651096 (Why is no real title available?)
- Iceberg hashing: optimizing many hash-table criteria at once
- Internal pattern matching in small space and applications
- Linear work suffix array construction
- Locally Consistent Parsing for Text Indexing in Small Space
- Longest common extension
- Optimal Substring Equality Queries with Applications to Sparse Text Indexing
- Optimal-Time Dictionary-Compressed Indexes
- Polynomial hash functions are reliable (extended abstract)
- Radix Sorting with No Extra Space
- Selection and sorting in the ``restore model
- Simplified stable merging tasks
- Sparse suffix tree construction in optimal time and space
- Sparse suffix trees
- Sparse text indexing in small space
- Substring complexity in sublinear space
- Three Partition Refinement Algorithms
- Universal compressed text indexing
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 Q7255554)
