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, achieving average case O(nlog σ m/m) time with any , where n is the text size, m the pattern length, k the number of errors for edit distance, and σ the alphabet size. Our experimental results show the practicality of this novel and promising research direction.
|Nombre||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|ISSN (versión impresa)||0302-9743|
|ISSN (versión digital)||1611-3349|
|Conferencia||19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008|
|Período||18/06/08 → 20/06/08|
© 2008 Springer-Verlag Berlin Heidelberg.