Sciweavers

Share
BMCBI
2006
120views more  BMCBI 2006»
9 years 9 months ago
Optimizing amino acid substitution matrices with a local alignment kernel
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...
Hiroto Saigo, Jean-Philippe Vert, Tatsuya Akutsu
BMCBI
2008
211views more  BMCBI 2008»
9 years 9 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
FPL
2008
Springer
150views Hardware» more  FPL 2008»
9 years 11 months ago
Compiler generated systolic arrays for wavefront algorithm acceleration on FPGAs
Wavefront algorithms, such as the Smith-Waterman algorithm, are commonly used in bioinformatics for exact local and global sequence alignment. These algorithms are highly computat...
Betul Buyukkurt, Walid A. Najjar
FPL
2003
Springer
130views Hardware» more  FPL 2003»
10 years 2 months ago
A Smith-Waterman Systolic Cell
With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching ...
Chi Wai Yu, K. H. Kwong, Kin-Hong Lee, Philip Heng...
ISPDC
2007
IEEE
10 years 3 months ago
Whole Genome Comparison on a Network of Workstations
Whole genome comparison consists of comparing or aligning genome sequences with a goal of finding similarities between them. Previously we have shown how SIMD Extensions used in ...
Arpith C. Jacob, Sugata Sanyal, Marcin Paprzycki, ...
IPPS
2008
IEEE
10 years 3 months ago
SWAMP: Smith-Waterman using associative massive parallelism
One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results s...
Shannon Steinfadt, Johnnie W. Baker
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
10 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
10 years 4 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada
RECOMB
2001
Springer
10 years 9 months ago
A new approach to sequence comparison: normalized sequence alignment
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...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
books