So the running time of the brute-force algorithm is O(n 2m); Notice that the LCS problem has optimal substructure: solutions of subproblems are parts of the ...
