License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2020.3
URN: urn:nbn:de:0030-drops-120336
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12033/
Bassino, Frédérique ;
Rakotoarimalala, Tsinjo ;
Sportiello, Andrea
The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings
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].
BibTeX - Entry
@InProceedings{bassino_et_al:LIPIcs:2020:12033,
author = {Fr{\'e}d{\'e}rique Bassino and Tsinjo Rakotoarimalala and Andrea Sportiello},
title = {{The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Michael Drmota and Clemens Heuberger},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12033},
URN = {urn:nbn:de:0030-drops-120336},
doi = {10.4230/LIPIcs.AofA.2020.3},
annote = {Keywords: Average-case analysis of algorithms, String Pattern Matching, Computational Complexity bounds}
}
Keywords: |
|
Average-case analysis of algorithms, String Pattern Matching, Computational Complexity bounds |
Collection: |
|
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
10.06.2020 |