Compressed parameterized pattern matching
DOI10.1016/J.TCS.2015.09.015zbMATH Open1331.68300OpenAlexW1795756762MaRDI QIDQ897868FDOQ897868
Authors: Richard Beal, Donald Adjeroh 
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
Recommendations
Huffman codesp-borderp-matchp-stringparameterized borderparameterized matchingparameterized stringlossless compressioncompressed 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)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Compression of individual sequences via variable-rate coding
- A universal algorithm for sequential data compression
- Approximate string matching on Ziv--Lempel compressed text
- Parameterized pattern matching: Algorithms and applications
- On-line construction of parameterized suffix trees for large alphabets
- Title not available (Why is that?)
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Alphabet dependence in parameterized matching
- Compressed matching in dictionaries
- Generalization of a suffix tree for RNA structural pattern matching
- \(p\)-suffix sorting as arithmetic coding
- Counting Parameterized Border Arrays for a Binary Alphabet
- Lightweight parameterized suffix array construction
- Data compression via textual substitution
- The structural border array
- Title not available (Why is that?)
- Parameterized longest previous factor
- Title not available (Why is that?)
- A theory of parameterized pattern matching
- Multiple matching of parameterized patterns
- Parameterized searching with mismatches for run-length encoded strings
- Parameterized matching with mismatches
- Faster suffix tree construction with missing suffix links
- Efficient pattern matching for RNA secondary structures
- Variations of the parameterized longest previous factor
- Two-dimensional parameterized matching
- Fast parameterized matching with \(q\)-grams
- Pattern matching in compressed texts and images
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Efficient Algorithms for the Inverse Sort Transform
- A method for compressing test data based on Burrows-Wheeler transformation
- Using Lossless Data Compression in Data Storage Systems: Not for Saving Space
- Optimal pattern matching in LZW compressed strings
Cited In (4)
This page was built for publication: Compressed parameterized pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897868)
