Comment on Faster string searching and matching with Rabin-Karp algorithmparentComments−rcthompson14yAsymptotically, string search based on the BWT is worst-case O(m+n).
Comments
Asymptotically, string search based on the BWT is worst-case O(m+n).