Bookmarks in Grammar-Compressed Strings

被引：0
|
作者：
Cording, Patrick Hagge [1 ]
Gawrychowski, Pawel [2 ]
Weimann, Oren [2 ]
机构：
[1] Tech Univ Denmark, DTU Compute, Lyngby, Denmark
[2] Univ Haifa, Haifa, Israel
来源：
STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2016 | 2016年 / 9954卷
关键词：
ALGORITHM; SEQUENCES;
D O I：
10.1007/978-3-319-46049-9_15
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions {i(1),..., i(b)} (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 book-marking problem either require more space or a super-constant "kick-off" time to start the decompression.
引用
收藏
页码：153 / 159
页数：7
相关论文
共 50 条
  • [1] Algorithms on Grammar-Compressed Strings
    Landau, Gad M.
    [J]. COMBINATORIAL PATTERN MATCHING, 22ND ANNUAL SYMPOSIUM, CPM 2011, 2011, 6661 : 1 - 1
  • [2] Finger Search in Grammar-Compressed Strings
    Bille, Philip
    Christiansen, Anders Roy
    Cording, Patrick Hagge
    Li Gortz, Inge
    [J]. THEORY OF COMPUTING SYSTEMS, 2018, 62 (08) : 1715 - 1735
  • [3] Detecting regularities on grammar-compressed strings
    Tomohiro, I
    Matsubara, Wataru
    Shimohira, Kouji
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    Narisawa, Kazuyuki
    Shinohara, Ayumi
    [J]. INFORMATION AND COMPUTATION, 2015, 240 : 74 - 89
  • [4] Random Access to Grammar-Compressed Strings
    Bille, Philip
    Landau, Gad M.
    Raman, Rajeev
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    Weimann, Oren
    [J]. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 373 - 389
  • [5] Detecting Regularities on Grammar-Compressed Strings
    Tomohiro, I
    Matsubara, Wataru
    Shimohira, Kouji
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    Narisawa, Kazuyuki
    Shinohara, Ayumi
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 571 - 582
  • [6] Finger Search in Grammar-Compressed Strings
    Philip Bille
    Anders Roy Christiansen
    Patrick Hagge Cording
    Inge Li Gørtz
    [J]. Theory of Computing Systems, 2018, 62 : 1715 - 1735
  • [7] Access, Rank, and Select in Grammar-compressed Strings
    Belazzougui, Djamal
    Cording, Patrick Hagge
    Puglisi, Simon J.
    Tabei, Yasuo
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 142 - 154
  • [8] RANDOM ACCESS TO GRAMMAR-COMPRESSED STRINGS AND TREES
    Bille, Philip
    Landau, Gad M.
    Raman, Rajeev
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    Weimann, Oren
    [J]. SIAM JOURNAL ON COMPUTING, 2015, 44 (03) : 513 - 539
  • [9] Pattern Matching on Grammar-Compressed Strings in Linear Time
    Ganardi, Moses
    Gawrychowskit, Pawel
    [J]. PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2833 - 2846
  • [10] Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
    Verbin, Elad
    Yu, Wei
    [J]. COMBINATORIAL PATTERN MATCHING, 2013, 7922 : 247 - 258
12345