38 search results - page 6 / 8 » A Coarse-Grained Multicomputer Algorithm for the Longest Com... |
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...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
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...
JCB
2000
13 years 5 months ago
2000
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...