Suffix-sorting via Shannon-Fano-Elias codes
From MaRDI portal
Publication:1662548
DOI10.3390/a3020145zbMath1461.68068OpenAlexW2175286270MaRDI QIDQ1662548
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a3020145
Analysis of algorithms (68W40) 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 (3)
Yang-Baxter equations, computational methods and applications ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Efficient pattern matching for RNA secondary structures
Cites Work
- Unnamed Item
- Replacing suffix trees with enhanced suffix arrays
- Engineering a lightweight suffix array construction algorithm
- Faster suffix sorting
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Fast Lightweight Suffix Array Construction and Checking
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
- New approaches for computer analysis of nucleic acid sequences.
- Algorithms on Strings, Trees and Sequences
- Asymptotic properties of data compression and suffix trees
- In-Place Suffix Sorting
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- On the sorting-complexity of suffix tree construction
- Combinatorial Pattern Matching
This page was built for publication: Suffix-sorting via Shannon-Fano-Elias codes
