GUTH, O. Computing All Approximate Enhanced Covers with the Hamming Distance. In: HOLUB, J. and J. ŽĎÁREK, eds. Proceedings of the Prague Stringology Conference 2016. Prague Stringology Conference 2016, Praha, 2016-08-29/2016-08-31. Praha: Czech Technical University in Prague, 2016. p. 146-157. ISBN 978-80-01-05996-8.
A border p of a string x is an enhanced cover of x if the number of positions of x that lie within some occurrence of p is the maximum among all borders of x. In this paper, more general notion based on the enhanced cover is introduced: a k-approximate enhanced cover, where fixed maximum number of errors k in the Hamming distance is considered. The k-approximate enhanced cover of x is its border and its k-approximate occurrences are also considered in the covered number of positions of x. An O(n^2)-time and a O(n)-space algorithm that computes all k-approximate enhanced covers of a string of length n is presented.
eng
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Czech Technical University in Prague
dc.relation.ispartof
Proceedings of the Prague Stringology Conference 2016