Two fast constructions of compact representations of binary words with given set of periods

DOI10.1016/j.tcs.2016.04.027zbMath1356.68305OpenAlexW2343059291MaRDI QIDQ507396

Wojciech Rytter

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.027

zbMATH Keywords

algorithmperiodicityborderscollage system

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Periods in strings
• Combinatorics of periods in strings.
• Collage system: A unifying framework for compressed pattern matching.
• Periods and binary words
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Algorithms on Strings
• Automata, Languages and Programming

This page was built for publication: Two fast constructions of compact representations of binary words with given set of periods