Pattern matching in compressed texts

DOI10.1007/3-540-60692-0_60MaRDI QIDQ2956695zbMATH OpenOpenAlexFDO

Authors S. R. Kosaraju

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_60

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 2185629
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• Let sleeping files lie: Pattern matching in Z-compressed files.
• scientific article; zbMATH DE number 1263249
• String matching in Lempel-Ziv compressed strings

Cited in

(23)

• Collage system: A unifying framework for compressed pattern matching.
• The complexity of compressed membership problems for finite automata
• Simple and efficient LZW-compressed multiple pattern matching
• scientific article; zbMATH DE number 1615280 (Why is no real title available?)
• scientific article; zbMATH DE number 1629861 (Why is no real title available?)
• Pattern matching in compressed texts and images
• Finding characteristic substrings from compressed texts
• Efficient special cases of pattern matching with swaps
• scientific article; zbMATH DE number 2185628 (Why is no real title available?)
• scientific article; zbMATH DE number 2185630 (Why is no real title available?)
• scientific article; zbMATH DE number 1003304 (Why is no real title available?)
• Window Subsequence Problems for Compressed Texts
• Processing Compressed Texts: A Tractability Border
• Pattern Matching in DCA Coded Text
• scientific article; zbMATH DE number 1998342 (Why is no real title available?)
• Optimal two-dimensional compressed matching
• scientific article; zbMATH DE number 1418326 (Why is no real title available?)
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Improving Time and Space Complexity for Compressed Pattern Matching
• Developments in Language Theory
• Pattern matching on run-length grammar-compressed strings in linear time
• Compressed parameterized pattern matching
• Let sleeping files lie: Pattern matching in Z-compressed files.

This page was built for publication: Pattern matching in compressed texts

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