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

DOI10.1016/J.TCS.2016.04.027MaRDI QIDQ507396zbMATH OpenOpenAlexFDO

Authors 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

algorithmborderscollage systemperiodicity

Mathematics Subject Classification ID

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

Recommendations

• Periods and binary words
• Computing Minimum Length Representations of Sets of Words of Uniform Length
• scientific article; zbMATH DE number 1754624
• Computing minimum length representations of sets of words of uniform length
• Local periods and binary partial words: an algorithm

Cites work

• Algorithms on Strings
• Algorithms on Strings, Trees and Sequences
• Automata, Languages and Programming
• Collage system: A unifying framework for compressed pattern matching.
• Combinatorics of periods in strings.
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• Periods and binary words
• Periods in strings

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

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