Author:
Gagie Travis,Gawrychowski Paweł,Puglisi Simon J.
Reference26 articles.
1. Efficient two-dimensional compressed matching;Amir,1992
2. Improved approximate string matching and regular expression matching on Ziv–Lempel compressed texts;Bille;ACM Trans. Algorithms,2009
3. Random access to grammar-compressed strings;Bille,2011
4. The smallest grammar problem;Charikar;IEEE Trans. Inf. Theory,2005
5. Improved grammar-based compressed indexes;Claude,2012
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lempel-Ziv (LZ77) Factorization in Sublinear Time;2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS);2024-10-27
2. Sublinear Time Lempel-Ziv (LZ77) Factorization;Lecture Notes in Computer Science;2023
3. Random Access in Persistent Strings and Segment Selection;Theory of Computing Systems;2022-12-17
4. Empirical evaluation of LZW-Compressed Multiple Pattern Matching Algorithms;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
5. Unified Compilation for Lossless Compression and Sparse Computing;2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO);2022-04-02