What are the available string matching algorithms besides Knuth-Morris-Pratt, Rabin-Karp and likes of it? -


what available string matching algorithms besides knuth-morris-pratt, rabin-karp , likes of it?

a cited compendium of these algorithms can found in:

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.133.4896&rep=rep1&type=pdf

included following algorithms:

karp-rabin  shift or  morris-pratt  knuth-morris-pratt simon  colussi  galil-giancarlo  apostolico-crochemore not naive  forward dawg matching   boyer-moore  turbo-bm  apostolico-giancarlo  reverse colussi  horspool  quick search  tuned boyer-moore zhu-takaoka  berry-ravindran  smith  raita  reverse factor  turbo reverse factor  backward oracle matching  

plus 15 others.

btw, might want clarify if interested in string similarity algorithms (e.g., levenshtein distance, etc), closely related, if indeed interested in that.


Comments

Popular posts from this blog

Javascript line number mapping -

c# - Is it possible to remove an existing registration from Autofac container builder? -

php - Mysql PK and FK char(36) vs int(10) -