scientific article; zbMATH DE number 7651109

DOI10.4230/LIPICS.CPM.2020.18MaRDI QIDQ5874446zbMATH OpenFDO

Authors Aleksander Kędzierski, Jakub Radoszewski

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2005.06329

zbMATH Keywords

Hamming distanceedit distanceapproximate coverapproximate seedenhanced cover

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• \(k\)-approximate quasiperiodicity under Hamming and edit distance
• Approximate seeds of strings
• Implementing approximate regularities
• On approximate enhanced covers under Hamming distance
• Approximate cover of strings

Cited in

(10)

• Approximate cover of strings
• Two strings at Hamming distance 1 cannot be both quasiperiodic
• Approximate cover of strings
• \(k\)-approximate quasiperiodicity under Hamming and edit distance
• String Covering: A Survey
• Implementing approximate regularities
• Approximate seeds of strings
• Quasi-periodicity under mismatch errors
• ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
• On approximate enhanced covers under Hamming distance

This page was built for publication:

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