Edit distance for a run-length-encoded string and an uncompressed string

被引：9

作者：

Liu, J. J.

Huang, G. S.

Wang, Y. L.

Lee, R. C. T.

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan

[2] Natl Chi Nan Univ, Dept Comp Sci & Informat Engn, Nantou, Taiwan

来源：

INFORMATION PROCESSING LETTERS | 2007年 / 105卷 / 01期

关键词：

edit distance; run-length-encoding; string compression; algorithms;

D O I：

10.1016/j.ipl.2007.07.006

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose a new algorithm for computing the edit distance of an uncompressed string against a run-length-encoded string. For an uncompressed string of length n and a compressed string with M runs, the algorithm computes their edit distance in time O(Mn). This result directly implies an O(min{mN, Mn}) time algorithm for strings of lengths m and n with M and N runs, respectively. It improves the previous best known time bound O(mN + Mn). (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：12 / 16

页数：5

共 50 条

[11] Efficient retrieval of approximate palindromes in a run-length encoded string
Chen, Kuan-Yu
Hsu, Ping-Hui
Chao, Kun-Mao
THEORETICAL COMPUTER SCIENCE, 2012, 432 : 28 - 37
[12] Explaining Propagators for String Edit Distance Constraints
Winter, Felix
Muslin, Nysret
Stuckey, Peter J.
THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1676 - 1683
[13] Constrained longest common subsequences with run-length-encoded strings
Liu, Jia-Jie (jjliu@cc.shu.edu.tw), 1600, Oxford University Press (58):
[14] Oblivious String Embeddings and Edit Distance Approximations
Batu, Tugkan
Ergun, Funda
Sahinalp, Cenk
PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 792 - 801
[15] The String Edit Distance Matching Problem With Moves
Cormode, Graham
Muthukrishnan, S.
ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (01)
[16] The string edit distance matching problem with moves
Cormode, G
Muthukrishnan, S
PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 667 - 676
[17] Classes of cost functions for string edit distance
S. V. Rice
H. Bunke
T. A. Nartker
Algorithmica, 1997, 18 : 271 - 280
[18] Classes of cost functions for string edit distance
Rice, SV
Bunke, H
Nartker, TA
ALGORITHMICA, 1997, 18 (02) : 271 - 280
[19] Template-based rendering of run-length-encoded volumes
Lee, CH
Koo, YM
Shin, YG
JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION, 1998, 9 (03): : 145 - 161
[20] Longest Common Subsequence Problem for Run-Length-Encoded Strings
Ahsan, Shegufta Bakht
Aziz, Syeda Persia
Rahman, M. Sohel
2012 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2012, : 36 - 41

← 1 2 3 4 5 →