Suffix-sorting via Shannon-Fano-Elias codes
From MaRDI portal
Publication:1662548
DOI10.3390/A3020145zbMATH Open1461.68068OpenAlexW2175286270MaRDI QIDQ1662548FDOQ1662548
Authors: Fei Nan, Donald Adjeroh 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a3020145
Recommendations
Analysis of algorithms (68W40) Data structures (68P05) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Linear work suffix array construction
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Suffix Arrays: A New Method for On-Line String Searches
- Space efficient linear time construction of suffix arrays
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Breaking a time-and-space barrier in constructing full-text indices
- Replacing suffix trees with enhanced suffix arrays
- Engineering a lightweight suffix array construction algorithm
- Constructing suffix arrays in linear time
- On the sorting-complexity of suffix tree construction
- New approaches for computer analysis of nucleic acid sequences.
- In-Place Suffix Sorting
- Fast lightweight suffix array construction and checking
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
- Faster suffix sorting
- Asymptotic properties of data compression and suffix trees
- Combinatorial Pattern Matching
Cited In (5)
This page was built for publication: Suffix-sorting via Shannon-Fano-Elias codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662548)
