2 ms·Asymptotically, string search based on the BWT is worst-case O(m+n).by rcthompson 15y agoAsymptotically, string search based on the BWT is worst-case O(m+n).