Suffix-sorting via Shannon-Fano-Elias codes

DOI10.3390/A3020145MaRDI QIDQ1662548zbMATH OpenOpenAlexFDO

Authors Fei Nan, Donald Adjeroh

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a3020145

zbMATH Keywords

suffix arrayssuffix treesource codingShannon-Fano-Elias codessuffix sorting

Mathematics Subject Classification ID

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)

Recommendations

• Faster suffix sorting
• Space efficient linear time construction of suffix arrays
• Space efficient linear time construction of suffix arrays
• In-Place Suffix Sorting
• Optimal in-place suffix sorting

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• Asymptotic properties of data compression and suffix trees
• Breaking a time-and-space barrier in constructing full-text indices
• Combinatorial Pattern Matching
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Constructing suffix arrays in linear time
• Engineering a lightweight suffix array construction algorithm
• Fast lightweight suffix array construction and checking
• Faster suffix sorting
• In-Place Suffix Sorting
• Linear Time Suffix Array Construction Using D-Critical Substrings
• Linear work suffix array construction
• New approaches for computer analysis of nucleic acid sequences.
• On the sorting-complexity of suffix tree construction
• Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
• Replacing suffix trees with enhanced suffix arrays
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(5)

• Yang-Baxter equations, computational methods and applications
• p-suffix sorting as arithmetic coding
• p-suffix sorting as arithmetic coding
• Efficient pattern matching for RNA secondary structures
• In-Place Suffix Sorting

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)