Periodicity algorithms and a conjecture on overlaps in partial words

DOI10.1016/j.tcs.2012.03.034zbMath1250.68216OpenAlexW2081720934WikidataQ123029512 ScholiaQ123029512MaRDI QIDQ442242

Elara Willett, Robert Mercaş, Abraham Rashin, Francine Blanchet-Sadri

Publication date: 10 August 2012

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

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

zbMATH Keywords

periodicityfreenesscombinatorics on wordsoverlapspartial words

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (6)

Squareable Words ⋮ Border correlations, lattices, and the subgraph component polynomial ⋮ Computing primitively-rooted squares and runs in partial words ⋮ Computing Primitively-Rooted Squares and Runs in Partial Words ⋮ An algorithmic toolbox for periodic partial words ⋮ Periodicity in data streams with wildcards

Cites Work

• Unnamed Item
• Square-free partial words
• A generalization of Thue freeness for partial words
• Overlap-freeness in infinite partial words
• Freeness of partial words
• Periodicity Algorithms for Partial Words
• An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• Automatic Sequences

This page was built for publication: Periodicity algorithms and a conjecture on overlaps in partial words