Approximate seeds of strings

MaRDI QIDQ5446122zbMATH OpenFDO

Authors Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, J. S. Sim

Publication date 6 March 2008

zbMATH Keywords

Hamming distanceweighted edit distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Approximation algorithms (68W25)

Recommendations

• Generalized approximate regularities in strings
• k-approximate quasiperiodicity under Hamming and edit distance
• scientific article; zbMATH DE number 7651109
• Efficient seeds computation revisited
• Implementing approximate regularities

Cited in

(13)

• Efficient algorithms for shortest partial seeds in words
• k-approximate quasiperiodicity under Hamming and edit distance
• Experimental evaluation of algorithms for computing quasiperiods
• On approximate enhanced covers under Hamming distance
• Approximate cover of strings
• Can we recover the cover?
• Quasi-Periodicity in Streams
• Quasi-periodicity under mismatch errors
• Generalized approximate regularities in strings
• scientific article; zbMATH DE number 7651109 (Why is no real title available?)
• Efficient Computation of 2-Covers of a String.
• String Covering: A Survey
• Implementing approximate regularities

This page was built for publication: Approximate seeds of strings

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