Abstract

Abstract We introduce our research on compressed pattern matching technology that combines data compression and pattern matching. To show the results of this work, we explain the collage system proposed by Kida et al. in 2003 that is a unifying framework for compressed pattern matching, and we explain the Repair-VF method proposed by Yoshida and Kida in 2013 and the MR-Repair method proposed by Furuya et al. in 2019 as grammar compressions suitable for compressed pattern matching.

Keywords:
Compression (physics) Matching (statistics) Pattern matching Computer science Artificial intelligence Pattern recognition (psychology) Mathematics Materials science

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
61
Refs
0.22
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence
Network Packet Processing and Optimization
Physical Sciences →  Computer Science →  Hardware and Architecture
DNA and Biological Computing
Life Sciences →  Biochemistry, Genetics and Molecular Biology →  Molecular Biology
© 2026 ScienceGate Book Chapters — All rights reserved.