Approximate periodicity

Amihood Amir, Estrella Eisenberg, A. Levy

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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(nk loglogn) and under the swap distance in time O(n2). Finally, we show an O(n logn) algorithm for finite alphabets, and an O(n log3n) algorithm for infinite alphabets, that approximate the minimum number of mismatches between the input string and a closest periodic string under the Hamming distance.

Original languageEnglish
Pages (from-to)215-226
Number of pages12
JournalInformation and Computation
Volume241
DOIs
StatePublished - 1 Apr 2015

Bibliographical note

Publisher Copyright:
© 2015 Elsevier Inc. All rights reserved.

Keywords

  • Approximate matching
  • Approximate periodicity
  • Hamming distance
  • Periodicity
  • String algorithms
  • Swap distance

Fingerprint

Dive into the research topics of 'Approximate periodicity'. Together they form a unique fingerprint.

Cite this