Sciweavers

685 search results - page 27 / 137
» Performance of Runtime Optimization on BLAST
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
A performance model for fine-grain accesses in UPC
UPC’s implicit communication and fine-grain programming style make application performance modeling a challenging task. The correspondence between remote references and communi...
Zhang Zhang, S. R. Seidel
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
14 years 1 months ago
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...
RECOMB
2003
Springer
14 years 9 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
CSB
2004
IEEE
123views Bioinformatics» more  CSB 2004»
14 years 15 days ago
A New Hardware Architecture for Genomic and Proteomic Sequence Alignment
We describe a novel hardware architecture for genomic and proteomic sequence alignment which achieves a speed-up of two to three orders of magnitude over Smith-Waterman dynamic pr...
Greg Knowles, Paul Gardner-Stephen
RECONFIG
2009
IEEE
182views VLSI» more  RECONFIG 2009»
14 years 3 months ago
Scalability Studies of the BLASTn Scan and Ungapped Extension Functions
BLASTn is a ubiquitous tool used for large scale DNA analysis. Detailed profiling tests reveal that the most computationally intensive sections of the BLASTn algorithm are the sc...
Siddhartha Datta, Ron Sass