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 条

[21] A LINEAR-TIME ALGORITHM FOR ROUTING IN A CONVEX GRID
KAUFMANN, M
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (02) : 180 - 184
[22] A linear-time algorithm for studying genetic variation
Stojanovic, Nikola
Berman, Piotr
ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2006, 4175 : 344 - 354
[23] LINEAR-TIME ONLINE RECOGNITION ALGORITHM FOR PALSTAR
GALIL, Z
SEIFERAS, J
JOURNAL OF THE ACM, 1978, 25 (01) : 102 - 111
[24] AN ALMOST LINEAR-TIME ALGORITHM FOR GRAPH REALIZATION
BIXBY, RE
WAGNER, DK
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (01) : 99 - 123
[25] A SIMPLE LINEAR-TIME ALGORITHM FOR INSITU MERGING
MANNILA, H
UKKONEN, E
INFORMATION PROCESSING LETTERS, 1984, 18 (04) : 203 - 208
[26] A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS
GABOW, HN
INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 20 - 22
[27] A linear-time algorithm for trust region problems
Hazan, Elad
Koren, Tomer
MATHEMATICAL PROGRAMMING, 2016, 158 (1-2) : 363 - 381
[28] 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
[29] 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
[30] A Linear-Time Parameterized Algorithm for Computing the Width of a
Caceres, Manuel
Cairo, Massimo
Mumey, Brendan
Rizzi, Romeo
Tomescu, Alexandru, I
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2021, 2021, 12911 : 257 - 269

← 1 2 3 4 5 →