Towards a definitive measure of repetitiveness
From MaRDI portal
Publication:2081618
DOI10.1007/978-3-030-61792-9_17OpenAlexW3115004854MaRDI QIDQ2081618
Nicola Prezza, Gonzalo Navarro, Tomasz Kociumaka
Publication date: 13 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-61792-9_17
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (15)
Novel results on the number of runs of the Burrows-Wheeler-transform ⋮ On the approximation ratio of LZ-end to LZ77 ⋮ A separation of \(\gamma\) and \(b\) via Thue-Morse words ⋮ On stricter reachable repetitiveness measures ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ Bit catastrophes for the Burrows-Wheeler transform ⋮ String attractors and infinite words ⋮ Substring complexities on run-length compressed strings ⋮ On Sensitivity of Compact Directed Acyclic Word Graphs ⋮ String attractors of episturmian sequences ⋮ Near-optimal search time in \(\delta \)-optimal space ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ A combinatorial view on string attractors ⋮ Block trees
This page was built for publication: Towards a definitive measure of repetitiveness
