Right-to-left online construction of parameterized position heaps

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

4 被引用数 (Scopus)


Two strings of equal length are said to parameterized match if there is a bijection that maps the characters of one string to those of the other string, so that two strings become identical. The parameterized pattern matching problem is, given two strings T and P, to find the occurrences of substrings in T that parameterized match P. Diptarama et al. [Position Heaps for Parameterized Strings, CPM 2017] proposed an indexing data structure called parameterized position heaps, and gave a left-toright online construction algorithm. In this paper, we present a right-to-left online construction algorithm for parameterized position heaps. For a text string T of length n over two kinds of alphabets Σand II of respective size σ and π, our construction algorithm runs in O(n log(σ+π)) time with O(n) space. Our right-to-left parameterized position heaps support pattern matching queries in O(mlog(σ+π)+mπ+pocc)) time, where m is the length of a query pattern P and pocc is the number of occurrences to report. Our construction and pattern matching algorithms are as efficient as Diptarama et al.'s algorithms.

ホスト出版物のタイトルProceedings of the Prague Stringology Conference, PSC 2018
編集者Jan Holub, Jan Zdarek
出版社Prague Stringology Club
出版ステータス出版済み - 2018
イベント22nd Prague Stringology Conference, PSC 2018 - Prague, チェコ共和国
継続期間: 8 27 20188 28 2018


名前Proceedings of the Prague Stringology Conference, PSC 2018


会議22nd Prague Stringology Conference, PSC 2018

All Science Journal Classification (ASJC) codes

  • 数学 (全般)


「Right-to-left online construction of parameterized position heaps」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。