Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets

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

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

1 Citation (Scopus)

Abstract

We present the first worst-case linear time algorithm that directly computes the parameterized suffix and LCP arrays for constant sized alphabets. Previous algorithms either required quadratic time or the parameterized suffix tree to be built first. More formally, for a string over static alphabet and parameterized alphabet, our algorithm runs in time and O(n) words of space, where is the number of distinct symbols of in the string.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings
EditorsNieves R. Brisaboa, Simon J. Puglisi
PublisherSpringer
Pages382-391
Number of pages10
ISBN (Print)9783030326852
DOIs
Publication statusPublished - Jan 1 2019
Event26th International Symposium on String Processing and Information Retrieval, SPIRE 2019 - Segovia, Spain
Duration: Oct 7 2019Oct 9 2019

Publication series

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

Conference

Conference26th International Symposium on String Processing and Information Retrieval, SPIRE 2019
CountrySpain
CitySegovia
Period10/7/1910/9/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets'. Together they form a unique fingerprint.

Cite this