Smith-Waterman

This page includes JavaScript functions that perform a Smith-Waterman pairwise squence alignment. You can control all the values in sigma table and the strings to be aligned. There is no error checking and if you enter random characters it will misbehave. Hit the back button on your browser and it goes away.

Please note that this is a static web page. I don't have privileges on the web server hosting this Smith-Waterman page. All the active code is in the form of JavaScript functions that get connected to event handlers by the browser. 100% of the code runs on your computer after the page has downloaded. Feel free to copy this and modify it to align any alphabet. Look at the polymorphic type converter to map the alphabet. A copyleft applies to this program.

Wirth Fast Search Simulation

This is a simulation of the Pascal code for the fastest string search algorithm known.

This Algorithm is a fast pattern search program. It is not language specific. This page runs a Java applet that steps through the algorithm at a speed of your chocie while it shows all the data invloved.