On extensions of maximal repeats in compressed strings

DOI10.4230/LIPICS.CPM.2020.27MaRDI QIDQ5874457zbMATH OpenFDO

Authors Julian Pape-Lange

Publication date 7 February 2023

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

zbMATH Keywords

Burrows-Wheeler transformBurrows-Wheeler transform conjectureCDAWGscombinatorics on compressed stringscompact suffix automataextensions of maximal repeatsLZ77maximal repeats

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• On maximal repeats in compressed strings
• The runs theorem and beyond
• Towards a Solution to the “Runs” Conjecture
• The ``runs theorem
• Novel results on the number of runs of the Burrows-Wheeler-transform

Cited in

(5)

• Cadences in grammar-compressed strings
• NC algorithms for finding a maximal set of paths with application to compressing strings
• On maximal repeats in compressed strings
• Exploiting new properties of string net frequency for efficient computation
• Upper bounds on distinct maximal (sub-)repetitions in compressed strings

This page was built for publication: On extensions of maximal repeats in compressed strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874457)