Quasiperiodicity and string covering

DOI10.1016/S0304-3975(98)00260-6zbMath0916.68121OpenAlexW2084458587MaRDI QIDQ1292493

Costas S. Iliopoulos, Laurent Mouchard

Publication date: 21 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00260-6

zbMATH Keywords

seedsperiodicitycoversquasiperiodicityregularities

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice, On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice, Quasiperiodic and Lyndon episturmian words, Can we recover the cover?, Experimental evaluation of algorithms for computing quasiperiods, An extension of the periodicity lemma to longer periods, Approximate cover of strings, Quasi-Periodicity Under Mismatch Errors

Cites Work

• A work-time optimal algorithm for computing all string covers
• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• An on-line string superprimitivity test
• Périodes locales et propagation de périodes dans un mot
• Testing string superprimitivity in parallel
• Covering a string
• A Lower Bound for Parallel String Matching
• Fast Pattern Matching in Strings
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item