Permuted pattern matching on multi-track strings

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

6 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルSOFSEM 2013
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 39th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
ページ280-291
ページ数12
DOI
出版ステータス出版済み - 2013
イベント39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013 - Spindleruv Mlyn, チェコ共和国
継続期間: 1 26 20131 31 2013

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7741 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013
Countryチェコ共和国
CitySpindleruv Mlyn
Period1/26/131/31/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Permuted pattern matching on multi-track strings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル