AN IMPROVED ALGORITHM FOR APPROXIMATE STRING MATCHING

被引：0
作者：
GALIL, Z [1 ]
PARK, K [1 ]
机构：
[1] TEL AVIV UNIV, DEPT COMP SCI, IL-69978 TEL AVIV, ISRAEL
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 372卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：394 / 404
页数：11
相关论文
共 50 条
  • [21] Multiple approximate string matching
    BaezaYates, R
    Navarro, G
    ALGORITHMS AND DATA STRUCTURES, 1997, 1272 : 174 - 184
  • [22] ALGORITHMS FOR APPROXIMATE STRING MATCHING
    UKKONEN, E
    INFORMATION AND CONTROL, 1985, 64 (1-3): : 100 - 118
  • [23] Spatial Approximate String Matching
    Katsumata, Akifumi
    Miura, Takao
    2009 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS 1 AND 2, 2009, : 123 - 128
  • [24] A Preprocessing for Approximate String Matching
    Baba, Kensuke
    Nakatoh, Tetsuya
    Yamada, Yasuhiro
    Ikeda, Daisuke
    INFORMATICS ENGINEERING AND INFORMATION SCIENCE, PT II, 2011, 252 : 610 - +
  • [25] Approximate String Matching with SIMD
    Fiori, Fernando J.
    Pakalen, Waltteri
    Tarhio, Jorma
    COMPUTER JOURNAL, 2022, 65 (06) : 1472 - 1488
  • [26] Improved approximate string matching using compressed suffix data structures
    Lam, Tak-Wah
    Sung, Wing-Kin
    Wong, Swee-Seong
    ALGORITHMICA, 2008, 51 (03) : 298 - 314
  • [27] Tries for approximate string matching
    Shang, H
    Merrettal, TH
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (04) : 540 - 547
  • [28] Improved Approximate String Matching Using Compressed Suffix Data Structures
    Tak-Wah Lam
    Wing-Kin Sung
    Swee-Seong Wong
    Algorithmica, 2008, 51 : 298 - 314
  • [29] Faster Approximate String Matching
    R. Baeza-Yates and G. Navarro
    Algorithmica, 1999, 23 : 127 - 158
  • [30] FAST APPROXIMATE STRING MATCHING
    OWOLABI, O
    MCGREGOR, DR
    SOFTWARE-PRACTICE & EXPERIENCE, 1988, 18 (04) : 387 - 393
12345