Abstract Internal Pattern Matching (IPM) queries on a length- n n text T, given two fragments X and Y of T such that |Y| | Y | 2 | X |, ask to compute all exact occurrences of X within Y. IPM queries have been introduced by Kociumaka, Radoszewski, Rytter, and Waleń SODA’15 & SICOMP’24, who showed that they can be answered in O (1) O (1) time using a data structure of size O (n) O (n) and used this result to answer various queries about fragments of T. In this work, we study IPM queries on compressed and dynamic strings. Our result is an O (n) O (log n) -time query algorithm applicable to any balanced recompression-based run-length straight-line program (RLSLP). In particular, one can use it on top of the RLSLP of Kociumaka, Navarro, and Prezza IEEE TIT’23, whose size O (n n) O (δ log n log σ δ log n) is optimal (among all text representations) as a function of the text length n, the alphabet size σ, and the substring complexity δ. Our procedure does not rely on any preprocessing of the underlying RLSLP, which makes it readily applicable on top of the dynamic strings data structure of Gawrychowski, Karczmarz, Kociumaka, Łącki and Sankowski SODA’18, which supports fully persistent updates in logarithmic time with high probability.
Duyster et al. (Mon,) studied this question.