Sciweavers

147 search results - page 1 / 30
» Algorithms for Computing the Longest Parameterized Common Su...
Sort
View
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
14 years 5 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
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 ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...
CJ
2008
90views more  CJ 2008»
13 years 11 months ago
Parameterized Complexity and Biopolymer Sequence Comparison
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A....
CAI
2010
Springer
13 years 8 months ago
Constrained Longest Common Subsequence Computing Algorithms in Practice
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...
Sebastian Deorowicz, J. Obstoj
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
14 years 2 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
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...
M. Sohel Rahman, Costas S. Iliopoulos
FCS
2006
14 years 6 days ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems