Lightweight parameterized suffix array construction

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

doi:10.1007/978-3-642-10217-2_31

Lightweight parameterized suffix array construction

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

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

23 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 language	English
Title of host publication	Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers
Publisher	Springer Verlag
Pages	312-323
Number of pages	12
ISBN (Print)	3642102166, 9783642102165
DOIs	https://doi.org/10.1007/978-3-642-10217-2_31
Publication status	Published - 2009

Publication series

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

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

I, T., 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). Springer Verlag. https://doi.org/10.1007/978-3-642-10217-2_31

Lightweight parameterized suffix array construction. / I, Tomohiro; Deguchi, Satoshi; Bannai, Hideo et al.
Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. Springer Verlag, 2009. p. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5874).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

I, T, 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, Springer Verlag, pp. 312-323. https://doi.org/10.1007/978-3-642-10217-2_31

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

I, Tomohiro ; Deguchi, Satoshi ; Bannai, Hideo et al. / Lightweight parameterized suffix array construction. Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. Springer Verlag, 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 = "Tomohiro I and Satoshi Deguchi and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda",

year = "2009",

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)",

publisher = "Springer Verlag",

pages = "312--323",

booktitle = "Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers",

address = "Germany",

}

TY - GEN

T1 - Lightweight parameterized suffix array construction

AU - I, Tomohiro

AU - Deguchi, Satoshi

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

PY - 2009

Y1 - 2009

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 - https://www.scopus.com/pages/publications/78650609899

UR - https://www.scopus.com/pages/publications/78650609899#tab=citedBy

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

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

M3 - Conference contribution

AN - SCOPUS:78650609899

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

PB - Springer Verlag

ER -

Lightweight parameterized suffix array construction

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this