\(p\)-suffix sorting as arithmetic coding
From MaRDI portal
Publication:1932361
DOI10.1016/j.jda.2012.05.001zbMath1257.68118OpenAlexW1970604951MaRDI QIDQ1932361
Richard Beal, Donald A. 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
arithmetic codingfingerprintsparameterized suffix array\(p\)-match\(p\)-stringparameterized suffix sorting
Related Items (7)
The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ Compressed parameterized pattern matching ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ A brief history of parameterized matching problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized longest previous factor
- Multiple matching of parameterized patterns
- Alphabet dependence in parameterized matching
- Suffix-sorting via Shannon-Fano-Elias codes
- Generalization of a suffix tree for RNA structural pattern matching
- Engineering a lightweight suffix array construction algorithm
- Parameterized pattern matching: Algorithms and applications
- On-line construction of parameterized suffix trees for large alphabets
- p-Suffix Sorting as Arithmetic Coding
- Suffix Arrays: A New Method for On-Line String Searches
- Faster suffix tree construction with missing suffix links
- Linear work suffix array construction
- Lightweight Parameterized Suffix Array Construction
- New approaches for computer analysis of nucleic acid sequences.
- Efficient randomized pattern-matching algorithms
- A Note on the Height of Suffix Trees
- Algorithms on Strings, Trees and Sequences
- A theory of parameterized pattern matching
- In-Place Suffix Sorting
This page was built for publication: \(p\)-suffix sorting as arithmetic coding
