LIPIcs.AofA.2020.3.pdf
- Filesize: 0.54 MB
- 15 pages
Document
The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings
Authors
Andrea Sportiello 
-
Part of:
Volume:
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-06-10
File
Document Identifiers
Author Details
Cite AsGet BibTex
Frédérique Bassino, Tsinjo Rakotoarimalala, and Andrea Sportiello. The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. In 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 159, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.AofA.2020.3
https://doi.org/10.4230/LIPIcs.AofA.2020.3
Abstract
We describe a multiple string pattern matching algorithm which is well-suited for approximate search and dictionaries composed of words of different lengths. We prove that this algorithm has optimal complexity rate up to a multiplicative constant, for arbitrary dictionaries. This extends to arbitrary dictionaries the classical results of Yao [SIAM J. Comput. 8, 1979], and Chang and Marr [Proc. CPM94, 1994].
Subject Classification
ACM Subject Classification
- Theory of computation → Formal languages and automata theory
- Theory of computation → Design and analysis of algorithms
Keywords
- Average-case analysis of algorithms
- String Pattern Matching
- Computational Complexity bounds
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Alfred V. Aho and Margaret J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975.
-
Frédérique Bassino, Tsinjo Rakotoarimalala, and Andrea Sportiello. The complexity of the Multiple Pattern Matching Problem for random strings. In 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 40-53. SIAM, 2018.
-
Robert S Boyer and J Strother Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
-
William I. Chang and Eugene L. Lawler. Sublinear approximate string matching and biological applications. Algorithmica, 12(4-5):327-344, 1994.
-
William I. Chang and Thomas G. Marr. Approximate string matching and local similarity. In Combinatorial Pattern Matching - CPM 1994, volume 807 of Lecture Notes in Computer Science, pages 259-273. Springer, 1994.
-
Kimmo Fredriksson and Szymon Grabowski. Average-optimal string matching. Journal of Discrete Algorithms, 7(4):579-594, 2009.
-
Donald E. Knuth, James H. Morris, and Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977.
-
Gonzalo Navarro. A guided tour to approximate string matching. ACM Computing Surveys (CSUR), 33(1):31-88, 2001.
-
Gonzalo Navarro and Kimmo Fredriksson. Average complexity of exact and approximate multiple string matching. Theoretical Computer Science, 321(2-3):283-290, 2004.
-
Peter H. Sellers. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms, 1(4):359-373, 1980.
-
Andrew Chi-Chih Yao. The complexity of pattern matching for a random string. SIAM Journal on Computing, 8(3):368-387, 1979.