Optimal in-place suffix sorting
From MaRDI portal
Publication:2672235
DOI10.1016/j.ic.2021.104818OpenAlexW3213146285MaRDI QIDQ2672235
Jian Li, Hongwei Huo, Zhize Li
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08305
Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items
Improved characters distance sampling for online and offline text searching, Classical and Quantum Algorithms for Assembling a Text from a Dictionary, Parallel suffix sorting for large string analytics, On the optimisation of the GSACA suffix array construction algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Replacing suffix trees with enhanced suffix arrays
- Lightweight data indexing and compression in external memory
- Faster suffix sorting
- Linear work suffix array construction
- Fast Lightweight Suffix Array Construction and Checking
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Simplified stable merging tasks
- A Space-Economical Suffix Tree Construction Algorithm
- Compression of individual sequences via variable-rate coding
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Selection and Sorting in the “Restore” Model
- In-Place Suffix Sorting
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Optimal in-place suffix sorting
