The parameterized pattern matching problem is to check if there exists a renaming bijection on the alphabet with which a given pattern can be transformed into a substring of a given text. A parameterized border array (p-border array) is a parameterized version of a standard border array, and we can efficiently solve the parameterized pattern matching problem using p-border arrays. In this paper we present an O(n1.5)-time O(n)-space algorithm to verify if a given integer array of length n is a valid p-border array for an unbounded alphabet. The best previously known solution takes time proportional to the n-th Bell number 1/e Σk=0∞ kn/k! , and hence our algorithm is quite efficient. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
I, T., Inenaga, S., Bannai, H., & Takeda, M. (2010). Verifying a parameterized border array in O(n1.5) time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6129, pp. 238–250). Springer Verlag. https://doi.org/10.1007/978-3-642-13509-5_22
Mendeley helps you to discover research relevant for your work.