A New Efficient Algorithm for Computing the Longest Common Subsequence

Costas S. Iliopoulos, M. Sohel Rahman
2008 Theory of Computing Systems  
The longest common subsequence(LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with many applications to genetics and molecular biology. In this paper, we present a new and efficient algorithm for solving the LCS problem for two strings. Our algorithm runs in O(R log log n) time, where R is the total number of ordered pairs of positions at which the two strings match.
doi:10.1007/s00224-008-9101-6 fatcat:biyyer3vxbcwjbtguf3luyr6ua