KMP based pattern matching algorithms for multi-track strings

Hendrian Diptarama, Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

Multi-track string is an N-tuple strings of length n. For two multi-track strings T = (t1; t2;⋯; tN) of length n and ℙ = (p1; p2; ⋯, pM) of length m, permuted pattern matching is a problem to find all positions i such that ℙ is permuted match with T[i : i+M]. We propose three new algorithms for permuted pattern matching based on the KMP algorithm. The first algorithm is an exact matching algorithm that runs in O(nN) time after O(mM)-time preprocessing. The second and third algorithms are filtering algorithms that run in O(n(N + σ)) after O(m(M + σ))-time preprocessing, where σ is the size of alphabet. Experiments show that our algorithms run faster than AC automaton based algorithm that proposed by Katsura et al. [5].

Original languageEnglish
Pages (from-to)100-107
Number of pages8
JournalCEUR Workshop Proceedings
Volume1548
Publication statusPublished - 2016 Jan 1
EventStudent Research Forum Papers and Posters at SOFSEM 2016, SOFSEM-SP 2016 - Harrachov, Czech Republic
Duration: 2016 Jan 232016 Jan 28

Keywords

  • KMP algorithm
  • Multi-track
  • String matching

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'KMP based pattern matching algorithms for multi-track strings'. Together they form a unique fingerprint.

  • Cite this