Exact string matching algorithms for biological sequence applications
#Naive method
TODO: Describe
Time complexity
O(nm) worst-case
Timing: worst-case: P = "aaa" T = "aaaaaaaaa" x 10^{1,2,3} (take minimum time over 5 runs), t in ms
81, 7411, 742569
Best-case - O(n): P = "bbb"
3, 28, 275
TODO: Describe Z algorithm for fundamental preprocessing, and its application in the simplest linear time matching algorithm; sketch diagram to illustrate the method and describe the variables used.
TODO: Describe algorithm