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 条
  • [21] A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
    Chen, Kuan-Yu
    Chao, Kun-Mao
    ALGORITHMS-ESA 2010, 2010, 6346 : 415 - 426
  • [22] A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
    Kuan-Yu Chen
    Kun-Mao Chao
    Algorithmica, 2013, 65 : 354 - 370
  • [23] A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
    Chen, Kuan-Yu
    Chao, Kun-Mao
    ALGORITHMICA, 2013, 65 (02) : 354 - 370
  • [24] GENERATION OF MULTIRESOLUTION MAPS FROM RUN-LENGTH-ENCODED DATA
    PERSSON, J
    JUNGERT, E
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SYSTEMS, 1992, 6 (06): : 497 - 510
  • [25] Constrained Longest Common Subsequences with Run-Length-Encoded Strings
    Liu, Jia-Jie
    Wang, Yue-Li
    Chiu, Yu-Shan
    COMPUTER JOURNAL, 2015, 58 (05): : 1074 - 1084
  • [26] Longest Common Subsequence Problem for Run-Length-Encoded Strings
    Ahsan, Shegufta Bakht
    Aziz, Syeda Persia
    Rahmana, M. Sohel
    JOURNAL OF COMPUTERS, 2014, 9 (08) : 1769 - 1775
  • [27] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    FUNDAMENTA INFORMATICAE, 2010, 101 (03) : 157 - 171
  • [28] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 93 - +
  • [29] Online Pattern Matching for String Edit Distance with Moves
    Takabatake, Yoshimasa
    Tabei, Yasuo
    Sakamoto, Hiroshi
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2014, 2014, 8799 : 203 - 214
  • [30] Online signature verification based on string edit distance
    Riesen, Kaspar
    Schmidt, Roman
    INTERNATIONAL JOURNAL ON DOCUMENT ANALYSIS AND RECOGNITION, 2019, 22 (01) : 41 - 54
12345