16 search results - page 2 / 4 » Dynamic programming algorithms for the mosaic longest common... |
CATA
2006
13 years 7 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...
SPIRE
2010
Springer
13 years 4 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
BIOCOMP
2006
13 years 7 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...
TCBB
2010
13 years 4 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
IEEESCC
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...