The Parameterized Suffix Tray

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

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

Abstract

Let Σ and Π be disjoint alphabets, respectively called the static alphabet and the parameterized alphabet. Two strings x and y over Σ∪ Π of equal length are said to parameterized match (p-match) if there exists a renaming bijection f on Σ and Π which is identity on Σ and maps the characters of x to those of y so that the two strings become identical. The indexing version of the problem of finding p-matching occurrences of a given pattern in the text is a well-studied topic in string matching. In this paper, we present a state-of-the-art indexing structure for p-matching called the parameterized suffix tray of an input text T, denoted by PSTray(T). We show that PSTray(T) occupies O(n) space and supports pattern matching queries in O(m+ log (σ+ π) + occ) time, where n is the length of t, m is the length of a query pattern P, π is the number of distinct symbols of | Π| in T, σ is the number of distinct symbols of | Σ| in T and occ is the number of p-matching occurrences of P in T. We also present how to build PSTray(T) in O(n) time from the parameterized suffix tree of T.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings
EditorsTiziana Calamoneri, Federico Corò
PublisherSpringer Science and Business Media Deutschland GmbH
Pages258-270
Number of pages13
ISBN (Print)9783030752415
DOIs
Publication statusPublished - 2021
Event12th International Conference on Algorithms and Complexity, CIAC 2021 - Virtual, Online
Duration: May 10 2021May 12 2021

Publication series

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

Conference

Conference12th International Conference on Algorithms and Complexity, CIAC 2021
CityVirtual, Online
Period5/10/215/12/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The Parameterized Suffix Tray'. Together they form a unique fingerprint.

Cite this