150 search results - page 13 / 30 » Parallel Generation of Pseudo-Random Sequences |
BMCBI
2007
13 years 11 months ago
2007
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
BMCBI
2010
13 years 11 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
BIBE
2008
IEEE
14 years 5 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
DATE
2006
IEEE
14 years 4 months ago
2006
IEEE
Multitasking on reconfigurable logic can achieve very high silicon reusability. However, configuration latency is a major limitation and it can largely degrade the system performa...