Practical Random Access to SLP-Compressed Texts-Reference-Cited by-同舟云学术

Practical Random Access to SLP-Compressed Texts

Published:2020 Issue: Volume: Page:221-231
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Gagie Travis^ORCID,I Tomohiro^ORCID,Manzini Giovanni^ORCID,Navarro Gonzalo^ORCID,Sakamoto Hiroshi^ORCID,Seelbach Benkner Louisa^ORCID,Takabatake Yoshimasa^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-59212-7_16

Reference35 articles.

1. Bannai, H., et al.: The smallest grammar problem revisited. CoRR, abs/1908.06428 (2019)

2. Lecture Notes in Computer Science;D Belazzougui,2015

3. Belazzougui, D., et al.: Queries on LZ-bounded encodings. In: 2015 Data Compression Conference, pp. 83–92. IEEE (2015)

4. Bille, P., Li Gørtz, I., Prezza, N.: Space-efficient re-pair compression. In: 2017 Data Compression Conference (DCC), pp. 171–180. IEEE (2017)

5. Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513–539 (2015)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Augmented Thresholds for MONI;2023 Data Compression Conference (DCC);2023-03

2. Compressed Data Structures for Population-Scale Positional Burrows–Wheeler Transforms;2022-09-19

3. Grammar Compression by Induced Suffix Sorting;ACM Journal of Experimental Algorithmics;2022-08-26

4. Finding Maximal Exact Matches Using the r-Index;Journal of Computational Biology;2022-02-01

5. MONI: A Pangenomic Index for Finding Maximal Exact Matches;Journal of Computational Biology;2022-02-01