This is my new implementation of the Longest Common Subsequence algorithm, and it's far better than my two previous attempts. This algorithm has less memory usage and is faster than the others because it just compares the common elements.
In my previous post, I was created a funtion for align two single sequences. The following code will align several input sequences with several output sequences, based on their align score.