216 search results - page 9 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
CSI
2006
13 years 8 months ago
2006
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
LATIN
1998
Springer
14 years 24 days ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
EVOW
2009
Springer
14 years 3 months ago
2009
Springer
We apply evolutionary computation to calibrate the parameters of a morphogenesis model of Drosophila early development. The model aims to describe the establishment of the steady g...
STOC
2000
ACM
14 years 28 days ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
IPPS
1999
IEEE
14 years 26 days ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...