Longest Common Extensions with Recompression.

DOI10.4230/LIPIcs.CPM.2017.18zbMath1434.68137arXiv1611.05359OpenAlexW2554482899MaRDI QIDQ5110882

Itagaki Tomohiro

Publication date: 25 May 2020

Full work available at URL: https://arxiv.org/abs/1611.05359

zbMATH Keywords

compressed data structurelongest common extension (LCE) queriesgrammar compressed stringsstraight-line program (SLP)

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (7)

Fingerprints in compressed strings ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ Internal dictionary matching ⋮ Small-space LCE data structure with constant-time queries ⋮ Lyndon factorization of grammar compressed texts revisited

This page was built for publication: Longest Common Extensions with Recompression.