Converting SLP to LZ78 in almost Linear Time-Reference-Cited by-同舟云学术

Converting SLP to LZ78 in almost Linear Time

Published:2013 Issue: Volume: Page:38-49
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Bannai Hideo,Gawrychowski Paweł,Inenaga Shunsuke,Takeda Masayuki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-38905-4_6

Reference24 articles.

1. Lecture Notes in Computer Science;S. Alstrup,2000

2. Lecture Notes in Computer Science;H. Bannai,2012

3. Cole, R., Hariharan, R.: Dynamic LCA queries on trees. In: Proc. SODA 1999, pp. 235–244 (1999)

4. Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J. Comput. 32(6), 1654–1673 (2003)

5. Gasieniec, L., Rytter, W.: Almost optimal fully LZW-compressed pattern matching. In: DCC 1999: Proceedings of the Conference on Data Compression, p. 316. IEEE Computer Society, Washington, DC (1999)

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

1. Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph;String Processing and Information Retrieval;2023

2. Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees;Algorithms;2021-01-29

3. LZ77 Computation Based on the Run-Length Encoded BWT;Algorithmica;2017-07-17

4. Faster Lyndon factorization algorithms for SLP and LZ78 compressed text;Theoretical Computer Science;2016-12

5. Longest common extensions in trees;Theoretical Computer Science;2016-07