What is the best algorithm to find the longest common subsequence for specific use cases? [closed]