2011
DOI: 10.1002/cpe.1753
|View full text |Cite
|
Sign up to set email alerts
|

Scalable multicore architectures for long DNA sequence comparison

Abstract: SUMMARYBiological sequence comparison is one of the most important tasks in Bioinformatics. Owing to the fast growth of databases that contain biological information, sequence comparison represents an important challenge for high-performance computing, especially when very long sequences are compared, i.e. the complete genome of several organisms. The Smith-Waterman (SW) algorithm is an exact method based on dynamic programming to quantify local similarity between sequences. The inherent large parallelism of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…We complement those experiments by looking at a different problem: the multiple sequence alignment with ClustalW [90]. Our results show that although ClustalW-PW also tolerates high memory latencies (similar to the observations in [75,82,83]), the bandwidth requirements are quite different. Moreover, we study a manycore based on ASIC accelerators while previous work [75] used ASIPs instead.…”
Section: Clustalw Implementationsmentioning
confidence: 52%
“…We complement those experiments by looking at a different problem: the multiple sequence alignment with ClustalW [90]. Our results show that although ClustalW-PW also tolerates high memory latencies (similar to the observations in [75,82,83]), the bandwidth requirements are quite different. Moreover, we study a manycore based on ASIC accelerators while previous work [75] used ASIPs instead.…”
Section: Clustalw Implementationsmentioning
confidence: 52%
“…Biological sequence comparison is one of the most important tasks in bioinformatics. In the paper Scalable multicore architectures for long DNA sequence comparison , Friman Sánchez from the Technical University of Catalonia and Felipe Cabarcas, Alex Ramirez, and Mateo Valero from the Barcelona Supercomputing Center, Spain, propose two implementations of the Smith–Waterman algorithm in the IBM Cell/BE architecture: one centralized and one distributed. The centralized approach uses the shared memory for communication and the distributed approach uses local buffers and a delayed synchronization protocol.…”
mentioning
confidence: 99%