Abstract
The problem of approximate parameterized string searching consists of finding, for a given text t = t 1 t 2 … t n and pattern p = p 1 p 2 … p m over respective alphabets Σ t and Σ p , the injection π i from Σ p to Σ t maximizing the number of matches between π i ( p ) and t i t i + 1 … t i + m − 1 ( i = 1 , 2 , … , n − m + 1 ) . We examine the special case where both strings are run-length encoded, and further restrict to the case where one of the alphabets is binary. For this case, we give a construction working in time O ( n + ( r p × r t ) α ( r t ) log ( r t ) ) , where r p and r t denote the number of runs in the corresponding encodings for y and x, respectively, and α is the inverse of the Ackermann's function.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call