A Linear-Time Algorithm for Hamming Distance with Shifts

  • Authors:

  • Minghui Jiang

  • Affiliations:

  • Utah State University, Department of Computer Science, 84322-4205, Logan, UT, USA

  • Venue:
  • Theory of Computing Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Hamming distance with shifts was introduced by Bookstein et al. as a generalization of the traditional Hamming distance to allow a tunable degree of fuzziness when comparing two binary sequences of the same length. We present a linear-time algorithm for computing this distance. The previous best time bound was quadratic.