p-suffix sorting as arithmetic coding

DOI10.1016/J.JDA.2012.05.001MaRDI QIDQ1932361zbMATH OpenOpenAlexFDO

Authors Richard Beal, Donald Adjeroh

Publication date 18 January 2013

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2012.05.001

zbMATH Keywords

fingerprintsarithmetic codingparameterized suffix array\(p\)-match\(p\)-stringparameterized suffix sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• p-suffix sorting as arithmetic coding
• Suffix-sorting via Shannon-Fano-Elias codes
• On the combinatorics of suffix arrays
• Optimal prefix free codes with partial sorting
• Optimal suffix sorting and LCP array construction for constant alphabets
• \(p\)-adic arithmetic coding
• An efficient, versatile approach to suffix sorting
• Approximation algorithms for sorting by length-weighted prefix and suffix operations
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 2230164

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1306895 (Why is no real title available?)
• scientific article; zbMATH DE number 910912 (Why is no real title available?)
• A Note on the Height of Suffix Trees
• A theory of parameterized pattern matching
• Algorithms on Strings, Trees and Sequences
• Alphabet dependence in parameterized matching
• Efficient randomized pattern-matching algorithms
• Engineering a lightweight suffix array construction algorithm
• Faster suffix tree construction with missing suffix links
• Generalization of a suffix tree for RNA structural pattern matching
• In-Place Suffix Sorting
• Lightweight parameterized suffix array construction
• Linear work suffix array construction
• Multiple matching of parameterized patterns
• New approaches for computer analysis of nucleic acid sequences.
• On-line construction of parameterized suffix trees for large alphabets
• Parameterized longest previous factor
• Parameterized pattern matching: Algorithms and applications
• Suffix Arrays: A New Method for On-Line String Searches
• Suffix-sorting via Shannon-Fano-Elias codes
• p-suffix sorting as arithmetic coding

Cited in

(10)

• The structural border array
• Variations of the parameterized longest previous factor
• Parameterized DAWGs: efficient constructions and bidirectional pattern searches
• p-suffix sorting as arithmetic coding
• Compressed parameterized pattern matching
• Sorting parity encodings by reusing variables
• Efficient pattern matching for RNA secondary structures
• A brief history of parameterized matching problems
• A prefix array for parameterized strings
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets

This page was built for publication: \(p\)-suffix sorting as arithmetic coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932361)