Fully Dynamic Data Structure for LCE Queries in Compressed Space
From MaRDI portal
Publication:4608635
DOI10.4230/LIPIcs.MFCS.2016.72zbMath1398.68110arXiv1605.01488OpenAlexW2963197538MaRDI QIDQ4608635
Hideo Bannai, Masayuki Takeda, Takaaki Nishimoto, Shunsuke Inenaga, Tomohiro I.
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1605.01488
Related Items
A separation between RLSLPs and LZ77, Document listing on repetitive collections with guaranteed performance, Fingerprints in compressed strings, Faster repetition-aware compressed suffix trees based on block trees, Balancing run-length straight-line programs, Unnamed Item, Universal compressed text indexing, Practical Performance of Space Efficient Data Structures for Longest Common Extensions., LZ77 computation based on the run-length encoded BWT, Dynamic index and LZ factorization in compressed space, Finger search in grammar-compressed strings, A compressed dynamic self-index for highly repetitive text collections, A Space-Optimal Grammar Compression., Small-space LCE data structure with constant-time queries