Jump to content

Commentz-Walter algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 109.60.76.183 (talk) at 10:14, 23 January 2013. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

--109.60.76.183 (talk) 10:14, 23 January 2013 (UTC)v-.b.v,v >-[1]s In computer science, the Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter. Like the Aho–Corasick string matching algorithm, it can search for multiple patterns at once. It combines ideas from Aho–Corasick with the fast matching of the Boyer–Moore string search algorithm. For a text of length n and maximum pattern length of L,

Bold text--109.60.76.183 (talk) 10:14, 23 January 2013 (UTC)Cite error: A <ref> tag is missing the closing </ref> (see the help page).]] </ref> its worst-case running time is O(nL), though the average case is often much better.[2]

GNU grep implements a string matching algorithm very similar to Commentz-Walter.[3]

References

  1. ^ ciferdxodlcodkd dldlfldlfioddfkdr
  2. ^ Watson, Bruce (1995). Taxonomies and Toolkits of Regular Language Algorithms (PDF). Eindhoven, The Netherlands: Eindhoven University of Technology. pp. 53, 116.
  3. ^ http://git.savannah.gnu.org/cgit/grep.git/tree/src/kwset.c


Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Commentz-Walter_algorithm&oldid=534468608"