38 search results - page 2 / 8 » A Coarse-Grained Multicomputer Algorithm for the Longest Com... |
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....
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...
IPL
2007
13 years 4 months ago
2007
CAI
2010
Springer
13 years 2 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
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...