Self-indexed Text Compression Using Straight-Line Programs-Reference-Cited by-同舟云学术

Self-indexed Text Compression Using Straight-Line Programs

Published:2009 Issue: Volume: Page:235-246
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2009
language:
Short-container-title:

Author:

Claude Francisco,Navarro Gonzalo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03816-7_21

Reference31 articles.

1. Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proc. 2nd DCC, pp. 279–288 (1992)

2. Lecture Notes in Computer Science;J. Barbay,2006

3. Bender, M., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comp. Sci. 321(1), 5–12 (2004)

4. Benoit, D., Demaine, E., Munro, I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275–292 (2005)

5. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE TIT 51(7), 2554–2576 (2005)

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

1. Indexing Highly Repetitive String Collections, Part II;ACM Computing Surveys;2022-03-31

2. Generalized Word Equations: A New Approach to Data Compresion;2019 Data Compression Conference (DCC);2019-03

3. On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry;Logical Methods in Computer Science;2015-06-19

4. Random Access to Grammar-Compressed Strings and Trees;SIAM Journal on Computing;2015-01

5. Fast relative Lempel–Ziv self-index for similar sequences;Theoretical Computer Science;2014-05