Lightweight parameterized suffix array construction

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

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

15 Citations (Scopus)

Abstract

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
Pages312-323
Number of pages12
DOIs
Publication statusPublished - Dec 1 2009
Event20th International Workshop on Combinatorial Algorithms, IWOCA 2009 - Hradec nad Moravici, Czech Republic
Duration: Jun 28 2009Jul 2 2009

Publication series

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

Other

Other20th International Workshop on Combinatorial Algorithms, IWOCA 2009
CountryCzech Republic
CityHradec nad Moravici
Period6/28/097/2/09

Fingerprint

Suffix Array
Prefix
Strings
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tomohiro, I., Deguchi, S., Bannai, H., Inenaga, S., & Takeda, M. (2009). Lightweight parameterized suffix array construction. In Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers (pp. 312-323). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5874 LNCS). https://doi.org/10.1007/978-3-642-10217-2_31

Lightweight parameterized suffix array construction. / Tomohiro, I.; Deguchi, Satoshi; Bannai, Hideo; Inenaga, Shunsuke; Takeda, Masayuki.

Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. 2009. p. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5874 LNCS).

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

Tomohiro, I, Deguchi, S, Bannai, H, Inenaga, S & Takeda, M 2009, Lightweight parameterized suffix array construction. in Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5874 LNCS, pp. 312-323, 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, Hradec nad Moravici, Czech Republic, 6/28/09. https://doi.org/10.1007/978-3-642-10217-2_31
Tomohiro I, Deguchi S, Bannai H, Inenaga S, Takeda M. Lightweight parameterized suffix array construction. In Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. 2009. p. 312-323. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10217-2_31
Tomohiro, I. ; Deguchi, Satoshi ; Bannai, Hideo ; Inenaga, Shunsuke ; Takeda, Masayuki. / Lightweight parameterized suffix array construction. Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. 2009. pp. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c9f21362cb484c0bb0e8b89af3698138,
title = "Lightweight parameterized suffix array construction",
abstract = "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{\"i}ve methods.",
author = "I. Tomohiro and Satoshi Deguchi and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-10217-2_31",
language = "English",
isbn = "3642102166",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "312--323",
booktitle = "Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers",

}

TY - GEN

T1 - Lightweight parameterized suffix array construction

AU - Tomohiro, I.

AU - Deguchi, Satoshi

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78650609899&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650609899&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10217-2_31

DO - 10.1007/978-3-642-10217-2_31

M3 - Conference contribution

SN - 3642102166

SN - 9783642102165

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 312

EP - 323

BT - Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers

ER -