Recommendation

Has Potential

Link

http://www.ics.uci.edu/~goodrich/dsa/11strings/demos/pattern/

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Michael Goodrich

Institution

Johns Hopkins University

Project

Goodrich's Collection

RelationshipToProject

PartOfCollection

Works

Yes

Description

This example illustrates the difference of two string matching algorithms, the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm.

Evaluation

After slight technical problems of getting the example to work it illustrated the algorithms rather clearly. The graphical presentation is sufficient and the program run flows in a reasonable speed. What I was left a bit bothered by was that the example did not provide any information on the algorithms itself except how they seem to work as they are tried. A pseudo-code representation (which could be followed the same time) or at least some textual explanation could be useful as well as the possibility to run the example step-by-step. Now this example doesn't really support self-studying but can well be used with a teacher explaining in the same time. The "Algorithm information: Skip Function" -part in the top is rather confusing and its purpose was not clear.

ActivityLevel

GoodFor

Lecture Aid

Screenshots

Videos

References

HowToUse

First Visited

2007

Last Visited

2008

Last Updated

2000

Topic

StringMatching

Community

Edit

You may edit this entry if you have an account.