Position heaps for parameterized strings

Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara

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

5 Citations (Scopus)

Abstract

We propose a new indexing structure for parameterized strings, called parameterized position heap. Parameterized position heap is applicable for parameterized pattern matching problem, where the pattern matches a substring of the text if there exists a bijective mapping from the symbols of the pattern to the symbols of the substring. We propose an online construction algorithm of parameterized position heap of a text and show that our algorithm runs in linear time with respect to the text size. We also show that by using parameterized position heap, we can find all occurrences of a pattern in the text in linear time with respect to the product of the pattern size and the alphabet size.

Original languageEnglish
Title of host publication28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
EditorsJakub Radoszewski, Juha Karkkainen, Jakub Radoszewski, Wojciech Rytter
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770392
DOIs
Publication statusPublished - 2017 Jul 1
Event28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 - Warsaw, Poland
Duration: 2017 Jul 42017 Jul 6

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume78
ISSN (Print)1868-8969

Other

Other28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
CountryPoland
CityWarsaw
Period17/7/417/7/6

Keywords

  • Indexing structure
  • Parameterized pattern matching
  • Position heap
  • String matching

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Position heaps for parameterized strings'. Together they form a unique fingerprint.

Cite this