News for hackers. Stuff that matters.
Re:Faster string searching and matching with Rabin-Karp algo... by ahelwer on Saturday April 07, 2012 @11:31AM (#3811110)
You are probably thinking of Smith-Waterman:

http://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorith...

Company I work at (in HPC) was in negotiations to implement it for one of those big plant biotech firms long before I was around, or so I have been told.

Re:Faster string searching and matching with Rabin-Karp algo... by epistasis on Monday April 09, 2012 @06:32PM (#3819612)
Smith-Waterman is the gold standard, but it's too slow for most applications so many heuristics have been developed.

BWA is the most popular tool these days for short-read mapping, and has a Smith-Waterman based approach for long reads as well:

http://bio-bwa.sourceforge.net/bwa.shtml