215 search results - page 1 / 43 » A New Efficient Algorithm for Computing the Longest Common S... |
AAIM
2007
Springer
13 years 8 months ago
2007
Springer
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 man...
TCS
2008
13 years 4 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
CPM
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...