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 条
  • [31] A new, simpler linear-time dominators algorithm
    Buchsbaum, AL
    Kaplan, H
    Rogers, A
    Westbrook, JR
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1998, 20 (06): : 1265 - 1296
  • [32] Linear-time algorithm for sliding tokens on trees
    Demaine, Erik D.
    Demaine, Martin L.
    Fox-Epstein, Eli
    Hoang, Duc A.
    Ito, Takehiro
    Ono, Hirotaka
    Otachic, Yota
    Uehara, Ryuhei
    Yamada, Takeshi
    THEORETICAL COMPUTER SCIENCE, 2015, 600 : 132 - 142
  • [33] A linear-time algorithm for trust region problems
    Elad Hazan
    Tomer Koren
    Mathematical Programming, 2016, 158 : 363 - 381
  • [34] A Linear-Time Algorithm for Broadcast Domination in a Tree
    Dabney, John
    Dean, Brian C.
    Hedetniemi, Stephen T.
    NETWORKS, 2009, 53 (02) : 160 - 169
  • [35] A Linear-time Algorithm for Optimal Tree Completion
    Aiemvaravutigul, Chawin
    Wongwattanakij, Nonthaphat
    2019 16TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2019), 2019, : 11 - 16
  • [36] A linear-time nearest point algorithm for the lattice An*
    McKilliam, Robby G.
    Clarkson, I. Vaughan L.
    Smith, Warren D.
    Quinn, Barry G.
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1239 - +
  • [37] A linear-time algorithm for finding a maximal planar subgraph
    Djidjev, Hristo N.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462
  • [38] Linear-time general decoding algorithm for the surface code
    Darmawan, Andrew S.
    Poulin, David
    PHYSICAL REVIEW E, 2018, 97 (05)
  • [39] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
    GABOW, HN
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263
  • [40] Linear-time algorithm to find modules of fault trees
    Universite Bordeaux I, Talence, France
    IEEE Trans Reliab, 3 (422-425):
12345