A quick tour on suffix arrays and compressed suffix arrays
From MaRDI portal
Publication:544881
DOI10.1016/j.tcs.2010.12.036zbMath1220.68054OpenAlexW1997116502MaRDI QIDQ544881
Publication date: 16 June 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.036
data compressionpattern matchingsuffix arraysuffix treetext indexingimplicitness and succinctnessspace efficiency
Related Items
Suffix array and Lyndon factorization of a text ⋮ On the combinatorics of suffix arrays ⋮ Estimating reliability of a repairable system with imperfect coverage and fuzzy parameters using parametric non-linear programming approach ⋮ Random Access to High-Order Entropy Compressed Text
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Counting suffix arrays and strings
- Parallel construction of a suffix tree with applications
- Lyndon words, permutations and trees.
- A note on the Burrows-Wheeler transformation
- On-line construction of suffix trees
- The myriad virtues of wavelet trees
- Space efficient linear time construction of suffix arrays
- Tight Bounds for Searching a Sorted Array of Strings
- Low Redundancy in Static Dictionaries with Constant Query Time
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
- Linear work suffix array construction
- Two-Dimensional Range Minimum Queries
- Indexing compressed text
- Fast Lightweight Suffix Array Construction and Checking
- Linear-Time Construction of Suffix Arrays
- Compression, Indexing, and Retrieval for Massive String Data
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On the Complexity of Searching a Set of Vectors
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Membership in Constant Time and Almost-Minimum Space
- New text indexing functionalities of the compressed suffix arrays
- Words over an ordered alphabet and suffix permutations
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- No sorting? better searching!
- Mathematical Foundations of Computer Science 2003
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
This page was built for publication: A quick tour on suffix arrays and compressed suffix arrays
