Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences

研究成果: Conference contribution

抄録

Given a text T of length n and a pattern P of length m, the string matching problem is a task to find all occurrences of P in T. In this study, we propose an algorithm that solves this problem in O((n +m)q) time considering the distance between two adjacent occurrences of the same q-gram contained in P. We also propose a theoretical improvement of it which runs in O(n+m) time, though it is not necessarily faster in practice. We compare the execution times of our and existing algorithms on various kinds of real and artificial datasets such as an English text, a genome sequence and a Fibonacci string. The experimental results show that our algorithm is as fast as the state-of-the-art algorithms in many cases, particularly when a pattern frequently appears in a text. 2012 ACM Subject Classification Theory of computation ! Pattern matching.

本文言語English
ホスト出版物のタイトル18th International Symposium on Experimental Algorithms, SEA 2020
編集者Simone Faro, Domenico Cantone
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771481
DOI
出版ステータスPublished - 2020 6 1
イベント18th International Symposium on Experimental Algorithms, SEA 2020 - Catania, Italy
継続期間: 2020 6 162020 6 18

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
160
ISSN(印刷版)1868-8969

Conference

Conference18th International Symposium on Experimental Algorithms, SEA 2020
国/地域Italy
CityCatania
Period20/6/1620/6/18

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル