An improvement of the franek-jennings-smyth pattern matching algorithm

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

In this paper, we propose a new pattern matching algorithm based on the Franek-Jennings-Smyth (FJS) algorithm. The FJS algorithm is a hybrid of the Knuth- Morris-Pratt (KMP) and the Sunday algorithms. The worst case time complexity of the KMP algorithm is linear time and the Sunday algorithm is quadratic time. However, the Sunday algorithm is faster than the KMP algorithm in practice. Inheriting the virtues of those algorithms, the FJS algorithm runs in linear time in the worst case and fast in practice. We improve the FJS algorithm by further taking an idea inspired by the Quite-Naive algorithm by Cantone and Faro. The experimental results show that our algorithm is faster than the FJS algorithm in general except when a pattern is extremely short.

本文言語English
ホスト出版物のタイトルProceedings of the Prague Stringology Conference, PSC 2019
編集者Jan Holub, Jan Zdarek
出版社Prague Stringology Club
ページ56-68
ページ数13
ISBN(電子版)9788001066188
出版ステータスPublished - 2019
イベント23rd Prague Stringology Conference, PSC 2019 - Prague, Czech Republic
継続期間: 2019 8 262019 8 28

出版物シリーズ

名前Proceedings of the Prague Stringology Conference, PSC 2019

Conference

Conference23rd Prague Stringology Conference, PSC 2019
国/地域Czech Republic
CityPrague
Period19/8/2619/8/28

ASJC Scopus subject areas

  • 数学 (全般)

フィンガープリント

「An improvement of the franek-jennings-smyth pattern matching algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル