147 search results - page 1 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
CPM
2007
Springer
14 years 5 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 ...
CJ
2008
13 years 11 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
CAI
2010
Springer
13 years 8 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
14 years 2 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...
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
14 years 7 days ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...