Sciweavers

Share
AAIM
2007
Springer

A New Efficient Algorithm for Computing the Longest Common Subsequence

11 years 9 months ago
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.
M. Sohel Rahman, Costas S. Iliopoulos
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where AAIM
Authors M. Sohel Rahman, Costas S. Iliopoulos
Comments (0)
books