Wednesday, January 10, 2018

Substring search/matching algorithms: KMP, Rabin-Karp








Match the prefix first (Knuth-Morris-Pratt, Shift-And, Aho-Corasick)


Knuth-Morris-Pratt(KMP Algorithm

  1. Match the suffix first (Boyer-Moore and variants, Commentz-Walter)


  1. Match the best factor first (BNDM, BOM, Set-BOM)


  1. Other strategy (Naive, Rabin-Karp)

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)
  • Devtools
    Chrome updates https://developers.google.com/web/updates/2018/03/nic65 Developer tools allows you to  https://developers.google.com/w...
  • Dynamic Programming
    The technique to divide problems into subproblems & making a judgment of solution based on solution of sub problems.... The pr...