Comparison of two revisions of an example file, based on their longest common subsequence (black) A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from the longest common substring: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The prob
![Longest common subsequence - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/b3035b45a85b0689a8c8816f07b64ed43236b970/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2F2%2F25%2FNubio_Diff_Screenshot3.png)