Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874021 | Information and Computation | 2015 | 12 Pages |
Abstract
Finding an approximate period in a given string S of length n is defined as follows. Let Sâ² be a periodic string closest to S under some distance metric, find the smallest period of Sâ². This period is called an approximate period of S under the given metric. Let the distance between the input string S and a closest periodic string under the Hamming distance Sâ² be k. We develop algorithms that construct an approximate period of S under the Hamming distance in time O(nklogâ¡logâ¡n) and under the swap distance in time O(n2). Finally, we show an O(nlogâ¡n) algorithm for finite alphabets, and an O(nlog3â¡n) algorithm for infinite alphabets, that approximate the minimum number of mismatches between the input string and a closest periodic string under the Hamming distance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Amihood Amir, Estrella Eisenberg, A. Levy,