Longest common subsequence algorithm

The longest common subsequence (LCS) is a well-known algorithm for finding the longest subsequence common to two or more sequences. It is commonly used in bioinformatics and other fields where sequence data is prevalent. The algorithm works by finding the longest subsequence that is present in all of the input sequences, and it does this by comparing the sequences one element at a time and keeping track of which elements are common to all of the sequences. The final output is the longest subsequence that was found.

At Tilores we use the Longest common subsequence algorithm as one of the potential data record matching algorithms for entity resolution. These can be combined with other matching algorithms to allow fine-tuned data matching and deduplication.