541 search results - page 1 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
BIOCOMP
2008
13 years 6 months ago
2008
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
AAIM
2007
Springer
13 years 9 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...
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...
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...