16 search results - page 1 / 4 » Parameterized Computation of LCS for Two Sequences |
BIOCOMP
2006
13 years 6 months ago
2006
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
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...
CPM
2007
Springer
13 years 11 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
2004
Springer
13 years 8 months ago
2004
Springer
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
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...