Sciweavers

189 search results - page 6 / 38
» Revisiting SIMD Programming
Sort
View
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
POS
1990
Springer
13 years 11 months ago
Persistence and Type Abstraction Revisited
nce and Type Abstraction Revisited Atsushi Ohori Ivan Tabkha Richard Connor
Atsushi Ohori, Ivan Tabkha, Richard C. H. Connor, ...
RIVF
2008
13 years 9 months ago
Speeding up subset seed algorithm for intensive protein sequence comparison
Abstract--Sequence similarity search is a common and repeated task in molecular biology. The rapid growth of genomic databases leads to the need of speeding up the treatment of thi...
Van Hoa Nguyen, Dominique Lavenier