Compressed parameterized pattern matching
From MaRDI portal
Publication:897868
DOI10.1016/j.tcs.2015.09.015zbMath1331.68300OpenAlexW1795756762MaRDI QIDQ897868
Donald A. Adjeroh, Richard Beal
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.015
lossless compressionHuffman codesp-borderp-matchp-stringparameterized borderparameterized matchingparameterized stringcompressed pattern matchingcatenateLZSSpACparameterized arithmetic codingTunstall codes
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structural border array
- Parameterized longest previous factor
- Efficient pattern matching for RNA secondary structures
- Multiple matching of parameterized patterns
- Parameterized searching with mismatches for run-length encoded strings
- Parameterized matching with mismatches
- Fast parameterized matching with \(q\)-grams
- Alphabet dependence in parameterized matching
- Compressed matching in dictionaries
- Approximate string matching on Ziv--Lempel compressed text
- Generalization of a suffix tree for RNA structural pattern matching
- Parameterized pattern matching: Algorithms and applications
- Variations of the parameterized longest previous factor
- \(p\)-suffix sorting as arithmetic coding
- On-line construction of parameterized suffix trees for large alphabets
- Pattern Matching in Compressed Texts and Images
- Faster suffix tree construction with missing suffix links
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Counting Parameterized Border Arrays for a Binary Alphabet
- Lightweight Parameterized Suffix Array Construction
- Data compression via textual substitution
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Algorithms on Strings, Trees and Sequences
- Efficient Algorithms for the Inverse Sort Transform
- A method for compressing test data based on Burrows-Wheeler transformation
- Two-Dimensional Parameterized Matching
- A theory of parameterized pattern matching
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Using Lossless Data Compression in Data Storage Systems: Not for Saving Space
