62 search results - page 4 / 13 » Faster Algorithms for Computing Longest Common Increasing Su... |
IPL
2007
13 years 7 months ago
2007
The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and st...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
JDA
2008
13 years 7 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
CATA
2006
13 years 8 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
CJ
2008
13 years 7 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...