Abstract
AbstractWe 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.
Reference56 articles.
1. A. Amir, G. Benson, Efficient two-dimensional compressed matching, in Proc. Data Compression Conference, p. 279 (1992)
2. A. Amir, G. Benson, M. Farach, Let sleeping files lie: pattern matching in Z-compressed files. J. Comput. Syst. Sci. 52, 299–307 (1996)
3. A. Apostolico, Z. Galil, Pattern Matching Algorithms (Oxford University Press, 1997)
4. A. Apostolico, S. Lonardi, Off-line compression by greedy textual substitution. Proc. IEEE 88(11), 1733–1744 (2000)
5. D. Belazzougui, P. Cording, S. Puglisi, Y. Tabei, Access, rank, and select in grammar-compressed strings, in Algorithms—ESA 2015, LNCS, vol. 9294 (Springer, 2015), pp. 142–154