A New Efficient Algorithm for Computing the Longest Common Subsequence

Abstract. 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 + n) time, where R is the total number of ordered pairs of positions at which the two strings match.

• Type: Conference
• Year: 2007
• Where: AAIM
• Authors: M. Sohel Rahman, Costas S. Iliopoulos
• Keywords: AAIM 2007, Algorithms, LCS Problem, Longest Common Subsequence, Well-studied Problem