Bookmarks in grammar-compressed strings

Patrick Hagge Cording; Pawel Gawrychowski; Oren Weimann

doi:https://doi.org/10.1007/978-3-319-46049-9_15

Bookmarks in grammar-compressed strings

Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann

Department of Computer Science

University of Haifa

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

Abstract

We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions {i1, …, ib} (bookmarks) such that any substring of length l crossing one of the positions can be decompressed in O(l) time. Our solution uses space O((n+b)max{1, log^∗ n−log^∗ (n/b + b/n)}). Existing solutions for the bookmarking problem either require more space or a super-constant “kick-off” time to start the decompression.

Original language	American English
Title of host publication	String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings
Editors	Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
Publisher	Springer Verlag
Pages	153-159
Number of pages	7
ISBN (Print)	9783319460482
DOIs	https://doi.org/10.1007/978-3-319-46049-9_15
State	Published - 2016
Event	23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 - Beppu, Japan Duration: 18 Oct 2016 → 20 Oct 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9954 LNCS

Conference

Conference	23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016
Country/Territory	Japan
City	Beppu
Period	18/10/16 → 20/10/16

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-319-46049-9_15

Cite this

Cording, P. H., Gawrychowski, P., & Weimann, O. (2016). Bookmarks in grammar-compressed strings. In S. Inenaga, K. Sadakane, & T. Sakai (Eds.), String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings (pp. 153-159). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9954 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-46049-9_15

Cording, Patrick Hagge ; Gawrychowski, Pawel ; Weimann, Oren. / Bookmarks in grammar-compressed strings. String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings. editor / Shunsuke Inenaga ; Kunihiko Sadakane ; Tetsuya Sakai. Springer Verlag, 2016. pp. 153-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7f35209dfd584478b820da918f949dce,

title = "Bookmarks in grammar-compressed strings",

abstract = "We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions {i1, …, ib} (bookmarks) such that any substring of length l crossing one of the positions can be decompressed in O(l) time. Our solution uses space O((n+b)max{1, log∗ n−log∗ (n/b + b/n)}). Existing solutions for the bookmarking problem either require more space or a super-constant “kick-off” time to start the decompression.",

author = "Cording, {Patrick Hagge} and Pawel Gawrychowski and Oren Weimann",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 ; Conference date: 18-10-2016 Through 20-10-2016",

year = "2016",

doi = "https://doi.org/10.1007/978-3-319-46049-9_15",

language = "American English",

isbn = "9783319460482",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "153--159",

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

booktitle = "String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings",

address = "Germany",

}

Cording, PH, Gawrychowski, P & Weimann, O 2016, Bookmarks in grammar-compressed strings. in S Inenaga, K Sadakane & T Sakai (eds), String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9954 LNCS, Springer Verlag, pp. 153-159, 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016, Beppu, Japan, 18/10/16. https://doi.org/10.1007/978-3-319-46049-9_15

Bookmarks in grammar-compressed strings. / Cording, Patrick Hagge; Gawrychowski, Pawel; Weimann, Oren.
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings. ed. / Shunsuke Inenaga; Kunihiko Sadakane; Tetsuya Sakai. Springer Verlag, 2016. p. 153-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9954 LNCS).

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

TY - GEN

T1 - Bookmarks in grammar-compressed strings

AU - Cording, Patrick Hagge

AU - Gawrychowski, Pawel

AU - Weimann, Oren

N1 - Publisher Copyright: © Springer International Publishing AG 2016.

PY - 2016

Y1 - 2016

N2 - We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions {i1, …, ib} (bookmarks) such that any substring of length l crossing one of the positions can be decompressed in O(l) time. Our solution uses space O((n+b)max{1, log∗ n−log∗ (n/b + b/n)}). Existing solutions for the bookmarking problem either require more space or a super-constant “kick-off” time to start the decompression.

AB - We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions {i1, …, ib} (bookmarks) such that any substring of length l crossing one of the positions can be decompressed in O(l) time. Our solution uses space O((n+b)max{1, log∗ n−log∗ (n/b + b/n)}). Existing solutions for the bookmarking problem either require more space or a super-constant “kick-off” time to start the decompression.

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

U2 - https://doi.org/10.1007/978-3-319-46049-9_15

DO - https://doi.org/10.1007/978-3-319-46049-9_15

M3 - Conference contribution

SN - 9783319460482

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

SP - 153

EP - 159

BT - String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings

A2 - Inenaga, Shunsuke

A2 - Sadakane, Kunihiko

A2 - Sakai, Tetsuya

PB - Springer Verlag

T2 - 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016

Y2 - 18 October 2016 through 20 October 2016

ER -

Cording PH, Gawrychowski P, Weimann O. Bookmarks in grammar-compressed strings. In Inenaga S, Sadakane K, Sakai T, editors, String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings. Springer Verlag. 2016. p. 153-159. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-319-46049-9_15

Bookmarks in grammar-compressed strings

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this