A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Combinatorial Pattern Matching
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter ǫ so that the algorithm is allowed to miss occurrences with probability ǫ. This is particularly appropriate for this problem, as approximate searching is used to model many cases where exact answers are not mandatory. We show that the relaxed version of the problem allows us breaking the average-case optimal lower bound of the classical problem, achievingdoi:10.1007/978-3-540-69068-9_14 dblp:conf/cpm/KiwiNT08 fatcat:u3k76xbhmnfqnffr6fvcknvypu