NOVEL DATA PACKING ALGORITHM FOR IMPROVED STRING MATCHING

被引:2
|
作者
TITCHENER, MR
机构
来源
关键词
D O I
10.1049/ip-e.1986.0024
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:185 / 193
页数:9
相关论文
共 50 条
  • [11] Study on a Parallel String Matching Algorithm for Data Quality Assessment
    Liu Bingbing
    2010 SECOND ETP/IITA WORLD CONGRESS IN APPLIED COMPUTING, COMPUTER SCIENCE, AND COMPUTER ENGINEERING, 2010, : 469 - 472
  • [12] A quantum algorithm for string matching
    Pradeep Niroula
    Yunseong Nam
    npj Quantum Information, 7
  • [13] Fast string matching algorithm
    Al-Howaide, Ala'a
    Mardini, Wail
    Khamayseh, Yaser
    Yasin, Muneer Bani
    2010 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING (MSE 2010), VOL 2, 2010, : 247 - 250
  • [14] A quantum algorithm for string matching
    Niroula, Pradeep
    Nam, Yunseong
    NPJ QUANTUM INFORMATION, 2021, 7 (01)
  • [15] A new string matching algorithm
    Ahmed, M
    Kaykobad, M
    Chowdhury, RA
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (07) : 825 - 834
  • [16] Improved approximate string matching using compressed suffix data structures
    Lam, Tak-Wah
    Sung, Wing-Kin
    Wong, Swee-Seong
    ALGORITHMICA, 2008, 51 (03) : 298 - 314
  • [17] A Novel Data Structure for String Matching Applicable in Network Processing
    Yazdani, Nasser
    Mohammadi, Hossein
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (7A): : 194 - 203
  • [18] Improved Approximate String Matching Using Compressed Suffix Data Structures
    Tak-Wah Lam
    Wing-Kin Sung
    Swee-Seong Wong
    Algorithmica, 2008, 51 : 298 - 314
  • [19] Improved approximate string matching using compressed suffix data structures
    Lam, TW
    Sung, WK
    Wong, SS
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 339 - 348
  • [20] BFM: a forward backward string matching algorithm with improved shifting for information retrieval
    Al-Faruk M.O.
    Hussain K.M.A.
    Shahriar M.A.
    Tonni S.M.
    International Journal of Information Technology, 2020, 12 (2) : 479 - 483