Longest Common Subsequence (LCS)

This is a GPL licensed implementation of the LCS-Delta algorithm which determines the longest - but not necessarily contiguous - subsequence of two given sequences. LCS is described thoroughly in the excellent book "Introduction to Algorithms", MIT Press, 2001, Second Edition, written by Thomas H. Cormen et. al.

This particular implementation is generic, i. e. given a "helper function" it can handle any type of data. A sample application "string_compare.c" is included. It takes two unicode strings as command line arguments and returns their longest common subsequence, so it also illustrates how to implement unicode processing and locales in C.

The source code can be downloaded as a ZIP archive or a TAR.GZ archive.