FAST AND PRACTICAL APPROXIMATE STRING MATCHING

被引：0
|
作者：
BAEZAYATES, RA
PERLEBERG, CH
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 644卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present new algorithms for approximate string matching based in simple, but efficient, ideas. First, We present an algorithm for string matching with mismatches based in arithmetical operations that runs in linear worst case time for most practical cases. This is a new approach to string searching. Second, we present an algorithm for string matching with errors based on partitioning the pattern that requires linear expected time for typical inputs.
引用
收藏
页码：185 / 192
页数：8
相关论文
共 50 条
  • [1] Fast and practical approximate string matching
    BaezaYates, RA
    Perleberg, CH
    INFORMATION PROCESSING LETTERS, 1996, 59 (01) : 21 - 27
  • [2] FAST APPROXIMATE STRING MATCHING
    OWOLABI, O
    MCGREGOR, DR
    SOFTWARE-PRACTICE & EXPERIENCE, 1988, 18 (04): : 387 - 393
  • [3] Fast approximate string matching in a dictionary
    Baeza-Yates, R
    Navarro, G
    STRING PROCESSING AND INFORMATION RETRIEVAL - PROCEEDINGS: A SOUTH AMERICAN SYMPOSIUM, 1998, : 14 - 22
  • [4] Fast index for approximate string matching
    Tsur, Dekel
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (04) : 339 - 345
  • [5] FAST APPROXIMATE STRING MATCHING.
    Owolabi, O.
    McGregor, D.R.
    Software - Practice and Experience, 1988, 18 (04) : 387 - 393
  • [6] Fast algorithms for approximate circular string matching
    Carl Barton
    Costas S Iliopoulos
    Solon P Pissis
    Algorithms for Molecular Biology, 9
  • [7] Fast algorithms for approximate circular string matching
    Barton, Carl
    Iliopoulos, Costas S.
    Pissis, Solon P.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2014, 9
  • [8] FAST PARALLEL AND SERIAL APPROXIMATE STRING MATCHING
    LANDAU, GM
    VISHKIN, U
    JOURNAL OF ALGORITHMS, 1989, 10 (02) : 157 - 169
  • [9] Very fast and simple approximate string matching
    Navarro, G
    BaezaYates, R
    INFORMATION PROCESSING LETTERS, 1999, 72 (1-2) : 65 - 70
  • [10] Fast approximate string matching with finite automata
    Hulden, Mans
    PROCESAMIENTO DEL LENGUAJE NATURAL, 2009, (43): : 57 - 64
12345