Permuted pattern matching on multi-track strings

Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We propose a new variant of pattern matching on a multi-set of strings, or multi-tracks, called permuted-matching, that looks for occurrences of a multi-track pattern of length m with M tracks, in a multi-track text of length n with N tracks over Σ. We show that the problem can be solved in O(nNlog|Σ|) time and O(mM + N) space, and further in O(nN) time and space when assuming an integer alphabet. For the case where the number of strings in the text and pattern are equal (full-permuted-matching), we propose a new index structure called the multi-track suffix tree, as well as an O(nN log|Σ|) time and O(nN) space construction algorithm. Using this structure, we can solve the full-permuted-matching problem in O(mN log|Σ| + occ) time for any multi-track pattern of length m with N tracks which occurs occ times.

Original languageEnglish
Title of host publicationSOFSEM 2013
Subtitle of host publicationTheory and Practice of Computer Science - 39th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
Pages280-291
Number of pages12
DOIs
Publication statusPublished - Jan 24 2013
Event39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013 - Spindleruv Mlyn, Czech Republic
Duration: Jan 26 2013Jan 31 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7741 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013
CountryCzech Republic
CitySpindleruv Mlyn
Period1/26/131/31/13

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Katsura, T., Narisawa, K., Shinohara, A., Bannai, H., & Inenaga, S. (2013). Permuted pattern matching on multi-track strings. In SOFSEM 2013: Theory and Practice of Computer Science - 39th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 280-291). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7741 LNCS). https://doi.org/10.1007/978-3-642-35843-2_25