Lightweight parameterized suffix array construction

Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

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

21 Citations (Scopus)


We present a first algorithm for direct construction of parameterized suffix arrays and parameterized longest common prefix arrays for non-binary strings. Experimental results show that our algorithm is much faster than naïve methods.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3642102166, 9783642102165
Publication statusPublished - 2009

Publication series

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Lightweight parameterized suffix array construction'. Together they form a unique fingerprint.

Cite this