On approximate enhanced covers under Hamming distance

DOI10.1016/J.DAM.2019.01.015MaRDI QIDQ2295626zbMATH OpenOpenAlexWikidataFDO

Authors Ondřej Guth

Publication date 14 February 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.01.015

zbMATH Keywords

approximate coverborderenhanced coverHamming distancequasiperiodicitystring regularitysuffix automaton

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7651109
• Enhanced covers of regular and indeterminate strings using prefix tables
• k-approximate quasiperiodicity under Hamming and edit distance
• Enhanced string covering
• ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS

Cites work

• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Approximate seeds of strings
• Computing covers using prefix tables
• Computing regularities in strings: a survey
• Computing the cover array in linear time
• Efficient Algorithms for Shortest Partial Seeds in Words
• Efficient detection of quasiperiodicities in strings
• Efficient seeds computation revisited
• Enhanced covers of regular and indeterminate strings using prefix tables
• Enhanced string covering
• Fast algorithm for partial covers in words
• scientific article; zbMATH DE number 5008420 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Implementing approximate regularities

Cited in

(8)

• k-approximate quasiperiodicity under Hamming and edit distance
• Experimental evaluation of algorithms for computing quasiperiods
• Quasi-Periodicity in Streams
• Enhanced covers of regular and indeterminate strings using prefix tables
• scientific article; zbMATH DE number 6292622 (Why is no real title available?)
• Efficient identification of k-closed strings
• scientific article; zbMATH DE number 7651109 (Why is no real title available?)
• String Covering: A Survey

This page was built for publication: On approximate enhanced covers under Hamming distance

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