Fast and Compact Regular Expression Matching

Details Fast and Compact Regular Expression Matching Fast and Compact Regular Expression Matching

2005-09-22

arxiv.org/abs/cs/0509069v3

Computer Science

Data Structures and Algorithms

Scientific paper

We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how to improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way.

Affiliated with

Also associated with

No associations

Rating

Fast and Compact Regular Expression Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast and Compact Regular Expression Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast and Compact Regular Expression Matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503170