Content deleted Content added
{{WikiProject Computer science}} |
fgrep not a good example |
||
Line 14:
[[User:Lokesh 2000|Lokesh 2000]] ([[User talk:Lokesh 2000|talk]]) 04:42, 20 January 2010 (UTC)
"The Aho–Corasick string matching algorithm formed the basis of the original Unix command fgrep."
Not a great example. There were better algorithms for finding a single fixed string in text which fgrep could have used (eg, Knuth-Morris-Pratt). Remember that the strength of Aho-Corasick lies in finding a match for any of a large set of fixed strings in text; and this is not what fgrep does. Aho-Corasick was easily extended to implement Kleene's regular expressions and this extension is used in grep and egrep. So Aho-Corasick's use in fgrep was simply a case of ease of implementation. A virus scanner is by far the best example of the use of Aho-Corasick: in one sequential read of a file there is a set of many thousands of virus "signature" strings compared. [[User:Gdt|Gdt]] ([[User talk:Gdt|talk]]) 06:16, 10 August 2012 (UTC)
== Visualization ==
| |||