Finding patterns with variable length gaps or don’t cares
Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M. and Smyth, W.F. (2006) Finding patterns with variable length gaps or don’t cares. Lecture Notes in Computer Science, 4112 . pp. 146-155.
*Subscription may be required
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our algorithm works in O(n + m + α log(max 1<=i<=l(b i –a i ))) time where n is the length of the text, m is the summation of the lengths of the component subpatterns, α is the total number of occurrences of the component subpatterns in the text and a i and b i are, respectively, the minimum and maximum number of don’t cares allowed between the ith and (i+1)st component of the pattern. We also present another algorithm which, given a suffix array of the text, can report whether P occurs in T in O(m + α loglogn) time. Both the algorithms record information to report all the occurrences of P in T. Furthermore, the techniques used in our algorithms are shown to be useful in many other contexts.
|Publication Type:||Journal Article|
|Copyright:||2006 Springer-Verlag Berlin Heidelberg|
|Notes:||12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006. Proceedings|
|Item Control Page|