The minimum edit distance can be computed using dynamic programming by storing the shortest path at each step. We define the minimum edit distance between two strings $X$ and $Y$ with lengths of $n$ and $m$ respectively. Let D[i, j] be defined as the edit distance between X[1..i] and Y[1..j]. The value D[n, m] represents the total minimum edit distance between $X$ and $Y$.