Efficient String Matching With Wildcards And Length Constraints

Springer London Ltd
Publication Type:
Journal Article
Knowledge And Information Systems, 2006, 10 (4), pp. 399 - 419
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011000605OK.pdf457.66 kB
Adobe PDF
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return each pattern occurrence in an online manner. In this pattern matching probl
Please use this identifier to cite or link to this item: