Re:Faster string searching and matching with Rabin-Karp algo...
by rcthompson on Saturday April 07, 2012 @03:47AM
(#3810269)
Asymptotically, string search based on the BWT is worst-case O(m+n).
[ Parent
| on HN ]
There are no comments on this comment yet.