String Indexing with Compressed Patterns
From MaRDI portal
Publication:6075857
DOI10.1145/3607141OpenAlexW2976802069MaRDI QIDQ6075857
Inge Li Gørtz, Philip Bille, Teresa Anna Steiner
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3607141
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On compressing and indexing repetitive sequences
- Lempel-Ziv index for \(q\)-grams
- Time-space trade-offs for Lempel-Ziv compressed indexing
- ESP-index: a compressed index based on edit-sensitive parsing
- Generalized substring compression
- Faster Fully Compressed Pattern Matching by Recompression
- Indexing Highly Repetitive Collections
- Indexed Multi-pattern Matching
- Longest Common Extensions in Sublinear Space
- Compressed representations of sequences and full-text indexes
- Fast Algorithms for Finding Nearest Common Ancestors
- Linear work suffix array construction
- Indexing compressed text
- The Smallest Grammar Problem
- Fast Prefix Search in Little Space, with Applications
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Efficient randomized pattern-matching algorithms
- Data compression via textual substitution
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Alphabet-Independent Compressed Text Indexing
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
- LZ77-Based Self-indexing with Faster Pattern Matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- On the sorting-complexity of suffix tree construction
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- String Indexing with Compressed Patterns.
