Abstract
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(max1
Cite
CITATION STYLE
APA
Rahman, M. S., Iliopoulos, C. S., Lee, I., Mohamed, M., & Smyth, W. F. (2006). Finding patterns with variable length gaps or don’t cares. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 146–155). Springer Verlag. https://doi.org/10.1007/11809678_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free