Re:Faster string searching and matching with Rabin-Karp algo...
by epistasis on Saturday April 07, 2012 @01:12AM
(#3810040)
There is a string search based on the BWT which is used for most DNA read mapping these days due to its favorable performance compared to existing hash based algorithms.
[ Parent
| on HN ]
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:
Re:Faster string searching and matching with Rabin-Karp algo...
by pjscott on Sunday April 08, 2012 @02:47AM
(#3813290)
Sequence alignment and string search are different enough problems that we really should distinguish between them.
Re:Faster string searching and matching with Rabin-Karp algo...
by epistasis on Monday April 09, 2012 @06:36PM
(#3819635)
General alignment definitely is quite different, however The vast majority of sequence data that's produced these days are short reads. Read-mapping is a much lower-bar and more similar to string search than proper sequence alignment. The BWT-based search [1] is a bit more practical with the small alphabet size of DNA compared to most human texts, however.