This applet shows the dynamic programming table for the
longest common subsequence algorithm described in the book
*Introduction to Algorithms* by Cormen, Leiserson and
Rivest.

Just edit the two textfields at the bottom (remember you have to press Return to generate the appropriate action event) to compute the LCS of any two strings you like. Currently has a fixed maximum length of 15 for each string.