• DocumentCode
    2540965
  • Title

    Filtering Based Multiple String Matching Algorithm Combining q-Grams and BNDM

  • Author

    Miao, Changsheng ; Chang, Guiran ; Wang, Xingwei

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
  • fYear
    2010
  • fDate
    13-15 Dec. 2010
  • Firstpage
    582
  • Lastpage
    585
  • Abstract
    We present a new algorithm for exact multiple string matching. Our algorithm is based on filtration combining BNDM and q-grams. We have tested it with experiments and compared it with other algorithms, e.g. DFA, AC_BM and MWM. The preprocessing phase of our algorithms is fast, the memory usage is fairly small, and our algorithm is considerably faster for huge sets of several thousand patterns. The benefits are due to the bit parallelism of BNDM and the improved filtering efficiency by q-grams.
  • Keywords
    computational linguistics; security of data; string matching; BNDM; backward nondeterministic DAWG matching; filtering based multiple string matching algorithm; q-gram method; Algorithm design and analysis; Approximation algorithms; Classification algorithms; Complexity theory; Computers; Filtering; Pattern matching; Backward Nondeterministic DAWG Matching (BNDM); q-BNDM; q-grams; strng matching;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-1-4244-8891-9
  • Electronic_ISBN
    978-0-7695-4281-2
  • Type

    conf

  • DOI
    10.1109/ICGEC.2010.149
  • Filename
    5715499
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2540965