scientific article; zbMATH DE number 7203312

DOI10.4230/LIPICS.CPM.2017.7zbMath1434.68122arXiv1705.08640MaRDI QIDQ5110870

Fabio Cunial, Djamal Belazzougui

Publication date: 25 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

context-free grammarsuffix treemaximal repeatCDAWGheavy path decomposition

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (6)

Faster repetition-aware compressed suffix trees based on block trees ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Block trees ⋮ Fast Label Extraction in the CDAWG ⋮ Unnamed Item ⋮ Online LZ77 Parsing and Matching Statistics with RLBWTs

This page was built for publication: