The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings

International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms Pub Date : 1900-01-01 DOI:10.4230/LIPIcs.AofA.2020.3

Frédérique Bassino, Tsinjo Rakotoarimalala, A. Sportiello

引用次数: 0

Abstract

15 We describe a multiple string pattern matching algorithm which is well-suited for approximate 16 search, and dictionaries composed of words of different lengths. We prove that this algorithm has 17 optimal complexity rate up to a multiplicative constant, for arbitrary dictionaries. This extends to 18 arbitrary dictionaries the classical results of Yao [SIAM J. Comput. 8, 1979] and Chang and Marr 19 [Proc. CPM94, 1994]. 2

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

随机字符串近似多模式匹配问题的复杂度

我们描述了一种多字符串模式匹配算法，它非常适合于近似16搜索，以及由不同长度的单词组成的字典。我们证明了该算法对于任意字典具有17个最优的复杂度，且复杂度可达一个乘法常数。姚[SIAM J. Comput. 8, 1979]和Chang and Marr 19 [Proc. CPM94, 1994]的经典结果扩展到18个任意词典。2

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms

自引率

0.00%

发文量

期刊最新文献

Phase Transition for Tree-Rooted Maps Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution Polyharmonic Functions in the Quarter Plane Random Partitions Under the Plancherel-Hurwitz Measure, High Genus Hurwitz Numbers and Maps Enumeration of d-Combining Tree-Child Networks