A Linear-Time Algorithm for Hamming Distance with Shifts

被引：2
|
作者：
Jiang, Minghui [1 ]
机构：
[1] Utah State Univ, Dept Comp Sci, Logan, UT 84322 USA
来源：
THEORY OF COMPUTING SYSTEMS | 2009年 / 44卷 / 03期
关键词：
Hamming distance; Swap distance; String algorithm; Combinatorial pattern matching;
D O I：
10.1007/s00224-007-9088-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：349 / 355
页数：7
相关论文
共 50 条
12345