String covering with optimal covers

DOI10.1016/J.JDA.2018.09.003MaRDI QIDQ1757464zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An optimal algorithm to compute all the covers of a string
• scientific article; zbMATH DE number 1003283
• Enhanced string covering
• Fast algorithm for partial covers in words
• A work-time optimal algorithm for computing all string covers

Cites work

• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Computing the cover array in linear time
• Efficient detection of quasiperiodicities in strings
• Enhanced covers of regular and indeterminate strings using prefix tables
• Enhanced string covering
• Fast algorithm for partial covers in words
• Fast, practical algorithms for computing all the repeats in a string
• Frequency covers for strings
• Introduction to algorithms.
• Optimal superprimitivity testing for strings
• The ``runs theorem
• The complexity of the minimum \(k\)-cover problem

Cited in

(7)

• String Covering: A Survey
• Can we recover the cover?
• Frequency covers for strings
• Quasi-Periodicity in Streams
• An optimal algorithm to compute all the covers of a string
• Inferring strings from cover arrays
• scientific article; zbMATH DE number 6850408 (Why is no real title available?)

This page was built for publication: String covering with optimal covers

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