String covering with optimal covers

DOI10.1016/j.jda.2018.09.003zbMath1409.68357OpenAlexW2898462080MaRDI QIDQ1757464

Neerja Mhaskar, W. F. Smyth

Publication date: 4 January 2019

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://researchrepository.murdoch.edu.au/id/eprint/42430/

zbMATH Keywords

coversrunsperiodicitiesquasi-periodicities

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Algorithms on strings (68W32)

Related Items

Can we recover the cover?, String Covering: A Survey, Quasi-Periodicity in Streams

Cites Work

• Enhanced string covering
• Fast algorithm for partial covers in words
• Fast, practical algorithms for computing all the repeats in a string
• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Frequency Covers for Strings
• The “Runs” Theorem
• Computing the cover array in linear time
• Unnamed Item
• Unnamed Item
• Unnamed Item