Learn how to use dynamic programming algorithms for string matching in two data structures: matrix and graph. Find patterns in texts with multiple dimensions.

Matrix Multiplication Let A be an n x m matrix B an m x p matrix The product of A and B is n x p matrix AB whose (i,j)-th entry is ∑k=1 m aik bkj In other words, we multiply the entries of the i-th ...