Abstract
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 \(\epsilon = \textrm{poly}(k/m)\), 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chang, W., Lawler, E.: Sublinear approximate string matching and biological applications. Algorithmica 12(4-5), 327–344 (1994)
Chang, W., Marr, T.: Approximate string matching and local similarity. In: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, pp. 259–273. Springer, Heidelberg (1994)
Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. ACM Journal of Experimental Algorithmics (article 1.4) 9 (2004)
Janson, S.: Large deviations for sums of partly dependent random variables. Random Structure & Algorithms 24(3), 234–248 (2004)
Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31–88 (2001)
Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin 24(4), 19–27 (2001)
Ron, D.: Property Testing. In: Handbook of Randomized Computing, volume II of Combinatorial Optimization, vol. 9. Springer, Heidelberg (2001)
Rubinfeld, R., Kumar, R.: Algorithms column: Sublinear time algorithms. SIGACT News 34(4), 57–67 (2003)
Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science 92, 191–211 (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiwi, M., Navarro, G., Telha, C. (2008). On-Line Approximate String Matching with Bounded Errors. In: Ferragina, P., Landau, G.M. (eds) Combinatorial Pattern Matching. CPM 2008. Lecture Notes in Computer Science, vol 5029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69068-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-69068-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69066-5
Online ISBN: 978-3-540-69068-9
eBook Packages: Computer ScienceComputer Science (R0)