133 search results - page 17 / 27 » The early introduction of dynamic programming into computati... |
IJPP
2011
13 years 2 months ago
2011
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
RECOMB
2001
Springer
14 years 8 months ago
2001
Springer
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
BCB
2010
13 years 2 months ago
2010
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
ISMB
1996
13 years 9 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...