Improving Time and Space Complexity for Compressed Pattern Matching

DOI10.1007/11940128_49zbMath1135.68634OpenAlexW1492525967MaRDI QIDQ5459143

Hiroshi Sakamoto, Shirou Maruyama, Hiromitsu Miyagawa

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

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

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