AN IMPROVED ALGORITHM FOR COMPUTING THE EDIT DISTANCE OF RUN-LENGTH CODED STRINGS

被引：34
|
作者：
BUNKE, H [1 ]
CSIRIK, J [1 ]
机构：
[1] UNIV SZEGED,DEPT APPL COMP SCI,H-6720 SZEGED,HUNGARY
来源：
INFORMATION PROCESSING LETTERS | 1995年 / 54卷 / 02期
关键词：
ALGORITHMS; APPROXIMATE STRING MATCHING; STRING EDIT DISTANCE;
D O I：
10.1016/0020-0190(95)00005-W
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：93 / 96
页数：4
相关论文
共 50 条
  • [31] Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
    Ghuman, Sukhpal Singh
    Giaquinta, Emanuele
    Tarhio, Jorma
    ALGORITHMS, 2019, 12 (06)
  • [32] IMPROVED RUN-LENGTH CODE FOR TYPEWRITTEN TEXT AND DRAWINGS
    ZAMPERONI, P
    NACHRICHTENTECHNISCHE ZEITSCHRIFT, 1972, 25 (04): : 204 - +
  • [33] Improved Sublinear-Time Edit Distance for Preprocessed Strings
    Bringmann, Karl
    Cassis, Alejandro
    Fischer, Nick
    Nakos, Vasileios
    Leibniz International Proceedings in Informatics, LIPIcs, 2022, 229
  • [34] DNN Split Computing: Quantization and Run-length Coding are Enough
    Carra, Damiano
    Neglia, Giovanni
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 7357 - 7362
  • [35] Approximate Matching for Run-Length Encoded Strings Is 3SUM-Hard
    Chen, Kuan-Yu
    Hsu, Ping-Hui
    Chao, Kun-Mao
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2009, 5577 : 168 - 179
  • [36] A Run-Length Based Connected Component Algorithm for FPGA Implementation
    Appiah, Kofi
    Hunter, Andrew
    Dickinson, Patrick
    Owens, Jonathan
    PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY, 2008, : 177 - 184
  • [37] Edit distance for a run-length-encoded string and an uncompressed string
    Liu, J. J.
    Huang, G. S.
    Wang, Y. L.
    Lee, R. C. T.
    INFORMATION PROCESSING LETTERS, 2007, 105 (01) : 12 - 16
  • [38] An algorithm for the rapid computation of boundaries of run-length encoded regions
    Quek, FKH
    PATTERN RECOGNITION, 2000, 33 (10) : 1637 - 1649
  • [39] Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
    Kiichi Watanabe
    Yuto Nakashima
    Shunsuke Inenaga
    Hideo Bannai
    Masayuki Takeda
    Theory of Computing Systems, 2020, 64 : 1273 - 1291
  • [40] Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
    Watanabe, Kiichi
    Nakashima, Yuto
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (07) : 1273 - 1291
12345