Finding Patterns with Variable Length Gaps or Don't Cares - CiteSeerX

15 downloads 0 Views 400KB Size Report
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 ...
Finding Patterns with Variable Length Gaps or Don’t Cares M. Sohel Rahman1,, , Costas S. Iliopoulos1,   , Inbok Lee2 , Manal Mohamed1 , and William F. Smyth3,† 1

Algorithm Design Group Department of Computer Science, King’s College London Strand, London WC2R 2LS, England {sohel, csi, manal}@dcs.kcl.ac.uk http://www.dcs.kcl.ac.uk/adg 2 School of Computer Science and Engineering Seoul National University, Seoul, Korea [email protected] 3 Algorithms Research Group, Department of Computing and Software, McMaster University, Canada [email protected]

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

Suggest Documents