Fast Online Lempel-Ziv Factorization in Compressed Space-Reference-Cited by-同舟云学术

Fast Online Lempel-Ziv Factorization in Compressed Space

Published:2015 Issue: Volume: Page:13-20
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Policriti Alberto,Prezza Nicola

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-23826-5_2

Reference18 articles.

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

2. Crochemore, M., Ilie, L.: Computing longest previous factor in linear time and applications. Information Processing Letters 106(2), 75–80 (2008)

3. Crochemore, M., Ilie, L., Smyth, W.F.: A simple algorithm for computing the Lempel-Ziv factorization. In: 18th Data Compression Conference (DCC 2008), pp. 482–488. IEEE Computer Society Press, Los Alamitos (2008)

4. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 390–398. IEEE (2000)

5. Ferragina, P., Manzini, G.: Indexing compressed text. Journal of the ACM (JACM) 52(4), 552–581 (2005)

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

1. Sublinear Time Lempel-Ziv (LZ77) Factorization;String Processing and Information Retrieval;2023

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

3. Computing the Parameterized Burrows–Wheeler Transform Online;String Processing and Information Retrieval;2022

4. Lempel-Ziv Factorization in Linear-Time O(1)-Workspace for Constant Alphabets;IEICE Transactions on Information and Systems;2021-12-01

5. Lempel–Ziv-Like Parsing in Small Space;Algorithmica;2020-05-25