How does the LCS diffing algorithm work?

LCS stands for Longest Common Subsequence. It is a dynamic programming algorithm that finds the longest sequence of lines present in both texts in the same order. Lines not in this sequence are marked as additions (if in the modified text) or deletions (if in the original text).