LCP Array Construction Using O(sort(n)) (or Less) I/Os

Juha Kärkkäinen; Dominik Kempa

doi:10.1007/978-3-319-46049-9_20

LCP Array Construction Using O(sort(n)) (or Less) I/Os

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

Original language	English
Title of host publication	String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings
Editors	Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
Number of pages	14
Volume	9954
Publisher	Springer
Publication date	21 Sept 2016
Pages	204-217
ISBN (Print)	978-3-319-46048-2
ISBN (Electronic)	978-3-319-46049-9
DOIs	https://doi.org/10.1007/978-3-319-46049-9_20
Publication status	Published - 21 Sept 2016
MoE publication type	A4 Article in conference proceedings
Event	Symposium on String Processing and Information Retrieval - Beppu, Japan Duration: 18 Oct 2016 → 20 Oct 2016 Conference number: 23 (SPIRE 2016)

Publication series

Name	Lecture Notes in Computer Science (LNCS)
Publisher	Springer
Volume	9954
ISSN (Electronic)	0302-9743

Fields of Science

113 Computer and information sciences
LCP array
longest common prefix array
suffix array
external memory algorithms

Access to Document

10.1007/978-3-319-46049-9_20

Cite this

Kärkkäinen, J., & Kempa, D. (2016). LCP Array Construction Using O(sort(n)) (or Less) I/Os. In S. Inenaga, K. Sadakane, & T. Sakai (Eds.), String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings (Vol. 9954, pp. 204-217). (Lecture Notes in Computer Science (LNCS); Vol. 9954). Springer. https://doi.org/10.1007/978-3-319-46049-9_20

Kärkkäinen, Juha ; Kempa, Dominik. / LCP Array Construction Using O(sort(n)) (or Less) I/Os. String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. editor / Shunsuke Inenaga ; Kunihiko Sadakane ; Tetsuya Sakai. Vol. 9954 Springer, 2016. pp. 204-217 (Lecture Notes in Computer Science (LNCS)).

@inproceedings{40c91ec7948d464bbe647ac635169138,

title = "LCP Array Construction Using O(sort(n)) (or Less) I/Os",

keywords = "113 Computer and information sciences, LCP array, longest common prefix array, suffix array, external memory algorithms",

author = "Juha K{\"a}rkk{\"a}inen and Dominik Kempa",

note = " Proceeding volume: 9954; Symposium on String Processing and Information Retrieval ; Conference date: 18-10-2016 Through 20-10-2016",

year = "2016",

month = sep,

day = "21",

doi = "10.1007/978-3-319-46049-9_20",

language = "English",

isbn = "978-3-319-46048-2",

volume = "9954",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

pages = "204--217",

editor = "Shunsuke Inenaga and Kunihiko Sadakane and Tetsuya Sakai",

booktitle = "String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings",

address = "United Kingdom",

}

Kärkkäinen, J & Kempa, D 2016, LCP Array Construction Using O(sort(n)) (or Less) I/Os. in S Inenaga, K Sadakane & T Sakai (eds), String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. vol. 9954, Lecture Notes in Computer Science (LNCS), vol. 9954, Springer, pp. 204-217, Symposium on String Processing and Information Retrieval, Beppu, Japan, 18/10/2016. https://doi.org/10.1007/978-3-319-46049-9_20

LCP Array Construction Using O(sort(n)) (or Less) I/Os. / Kärkkäinen, Juha; Kempa, Dominik.
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. ed. / Shunsuke Inenaga; Kunihiko Sadakane; Tetsuya Sakai. Vol. 9954 Springer, 2016. p. 204-217 (Lecture Notes in Computer Science (LNCS); Vol. 9954).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - LCP Array Construction Using O(sort(n)) (or Less) I/Os

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

N1 - Conference code: 23 (SPIRE 2016)

PY - 2016/9/21

Y1 - 2016/9/21

KW - 113 Computer and information sciences

KW - LCP array

KW - longest common prefix array

KW - suffix array

KW - external memory algorithms

U2 - 10.1007/978-3-319-46049-9_20

DO - 10.1007/978-3-319-46049-9_20

M3 - Conference contribution

SN - 978-3-319-46048-2

VL - 9954

T3 - Lecture Notes in Computer Science (LNCS)

SP - 204

EP - 217

BT - String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings

A2 - Inenaga, Shunsuke

A2 - Sadakane, Kunihiko

A2 - Sakai, Tetsuya

PB - Springer

T2 - Symposium on String Processing and Information Retrieval

Y2 - 18 October 2016 through 20 October 2016

ER -

Kärkkäinen J, Kempa D. LCP Array Construction Using O(sort(n)) (or Less) I/Os. In Inenaga S, Sadakane K, Sakai T, editors, String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. Vol. 9954. Springer. 2016. p. 204-217. (Lecture Notes in Computer Science (LNCS)). doi: 10.1007/978-3-319-46049-9_20