Improving Time and Space Complexity for Compressed Pattern Matching

DOI10.1007/11940128_49MaRDI QIDQ5459143zbMATH OpenOpenAlexFDO

Authors Shirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_49

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1998342
• scientific article; zbMATH DE number 1839439
• Compressed parameterized pattern matching
• scientific article; zbMATH DE number 1629861
• Faster approximate pattern matching in compressed repetitive texts
• Pattern matching in compressed texts
• Optimal pattern matching in LZW compressed strings
• Optimal pattern matching in LZW compressed strings

Cited in

(1)

• Developments in Language Theory

This page was built for publication: Improving Time and Space Complexity for Compressed Pattern Matching

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