The Parameterized Position Heap of a Trie

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

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings
EditorsPinar Heggernes
PublisherSpringer Verlag
Pages237-248
Number of pages12
ISBN (Print)9783030174019
DOIs
Publication statusPublished - 2019
Event11th International Conference on Algorithms and Complexity, CIAC 2019 - Rome, Italy
Duration: May 27 2019May 29 2019

Publication series

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

Conference

Conference11th International Conference on Algorithms and Complexity, CIAC 2019
Country/TerritoryItaly
CityRome
Period5/27/195/29/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The Parameterized Position Heap of a Trie'. Together they form a unique fingerprint.

Cite this