Tighter Bounds for the Sum of Irreducible LCP Values

Juha Kärkkäinen; Dominik Kempa; Marcin Piątkowski

doi:10.1007/978-3-319-19929-0_27

Tighter Bounds for the Sum of Irreducible LCP Values

Juha Kärkkäinen, Dominik Kempa, Marcin Piątkowski

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

Original language	English
Title of host publication	Combinatorial Pattern Matching : 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings
Editors	Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
Number of pages	13
Publisher	Springer International Publishing AG
Publication date	16 Jun 2015
Pages	316-328
ISBN (Print)	978-3-319-19928-3
ISBN (Electronic)	978-3-319-19929-0
DOIs	https://doi.org/10.1007/978-3-319-19929-0_27
Publication status	Published - 16 Jun 2015
MoE publication type	A4 Article in conference proceedings
Event	Annual Symposium on Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015 - Ischia, Italy Duration: 29 Jun 2015 → 1 Jul 2015 Conference number: 26

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer International Publishing
Volume	9133
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Fields of Science

113 Computer and information sciences
LCP array
irreducible LCP values
suffix array
Burrows-Wheeler transform

Access to Document

10.1007/978-3-319-19929-0_27

Cite this

Kärkkäinen, J., Kempa, D., & Piątkowski, M. (2015). Tighter Bounds for the Sum of Irreducible LCP Values. In F. Cicalese, E. Porat, & U. Vaccaro (Eds.), Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings (pp. 316-328). (Lecture Notes in Computer Science; Vol. 9133). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-19929-0_27

Kärkkäinen, Juha ; Kempa, Dominik ; Piątkowski, Marcin. / Tighter Bounds for the Sum of Irreducible LCP Values. Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings. editor / Ferdinando Cicalese ; Ely Porat ; Ugo Vaccaro. Springer International Publishing AG, 2015. pp. 316-328 (Lecture Notes in Computer Science).

@inproceedings{b6144d002cac4622acdd887ebcb83526,

title = "Tighter Bounds for the Sum of Irreducible LCP Values",

keywords = "113 Computer and information sciences, LCP array, irreducible LCP values, suffix array, Burrows-Wheeler transform",

author = "Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Marcin Pi{\c a}tkowski",

year = "2015",

month = jun,

day = "16",

doi = "10.1007/978-3-319-19929-0_27",

language = "English",

isbn = "978-3-319-19928-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer International Publishing AG",

pages = "316--328",

editor = "Ferdinando Cicalese and Ely Porat and Ugo Vaccaro",

booktitle = "Combinatorial Pattern Matching",

address = "Switzerland",

note = "Annual Symposium on Combinatorial Pattern Matching : 26th Annual Symposium, CPM 2015, CPM: Annual Symposium on Combinatorial Pattern Matching ; Conference date: 29-06-2015 Through 01-07-2015",

}

Kärkkäinen, J, Kempa, D & Piątkowski, M 2015, Tighter Bounds for the Sum of Irreducible LCP Values. in F Cicalese, E Porat & U Vaccaro (eds), Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9133, Springer International Publishing AG, pp. 316-328, Annual Symposium on Combinatorial Pattern Matching, Ischia, Italy, 29/06/2015. https://doi.org/10.1007/978-3-319-19929-0_27

Tighter Bounds for the Sum of Irreducible LCP Values. / Kärkkäinen, Juha; Kempa, Dominik; Piątkowski, Marcin.
Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings. ed. / Ferdinando Cicalese; Ely Porat; Ugo Vaccaro. Springer International Publishing AG, 2015. p. 316-328 (Lecture Notes in Computer Science; Vol. 9133).

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

TY - GEN

T1 - Tighter Bounds for the Sum of Irreducible LCP Values

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

AU - Piątkowski, Marcin

N1 - Conference code: 26

PY - 2015/6/16

Y1 - 2015/6/16

KW - 113 Computer and information sciences

KW - LCP array

KW - irreducible LCP values

KW - suffix array

KW - Burrows-Wheeler transform

U2 - 10.1007/978-3-319-19929-0_27

DO - 10.1007/978-3-319-19929-0_27

M3 - Conference contribution

SN - 978-3-319-19928-3

T3 - Lecture Notes in Computer Science

SP - 316

EP - 328

BT - Combinatorial Pattern Matching

A2 - Cicalese, Ferdinando

A2 - Porat, Ely

A2 - Vaccaro, Ugo

PB - Springer International Publishing AG

T2 - Annual Symposium on Combinatorial Pattern Matching

Y2 - 29 June 2015 through 1 July 2015

ER -

Kärkkäinen J, Kempa D, Piątkowski M. Tighter Bounds for the Sum of Irreducible LCP Values. In Cicalese F, Porat E, Vaccaro U, editors, Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings. Springer International Publishing AG. 2015. p. 316-328. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-19929-0_27