The Parameterized Position Heap of a Trie

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

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

1 被引用数 (Scopus)

抄録

Let and be disjoint alphabets of respective size and. Two strings over of equal length are said to parameterized match (p-match) if there is a bijection such that (1) f is identity on and (2) f maps the characters of one string to those of the other string so that the two strings become identical. We consider the p-matching problem on a (reversed) trie and a string pattern P such that every path that p-matches P has to be reported. Let N be the size of the given trie. In this paper, we propose the parameterized position heap for that occupies O(N) space and supports p-matching queries in time, where m is the length of a query pattern P and is the number of paths in to report. We also present an algorithm which constructs the parameterized position heap for a given trie in time and working space.

本文言語英語
ホスト出版物のタイトルAlgorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings
編集者Pinar Heggernes
出版社Springer Verlag
ページ237-248
ページ数12
ISBN(印刷版)9783030174019
DOI
出版ステータス出版済み - 1 1 2019
イベント11th International Conference on Algorithms and Complexity, CIAC 2019 - Rome, イタリア
継続期間: 5 27 20195 29 2019

出版物シリーズ

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

会議

会議11th International Conference on Algorithms and Complexity, CIAC 2019
Countryイタリア
CityRome
Period5/27/195/29/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「The Parameterized Position Heap of a Trie」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル