Parallel biological sequence alignments on the Cell Broadband Engine

被引:0
作者
Sarje, Abhinav [1 ]
Aluru, Srinivas [1 ]
机构
[1] Iowa State Univ, Dept Elect & Comp Engn, Ames, IA 50011 USA
来源
2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8 | 2008年
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Sequence alignment and its many variants are a fundamental tool in computational biology. There is considerable recent interest in using the Cell Broadband Engine, a heterogenous multi-core chip that provides high performance, for biological applications. However, work so far has been limited to computing optimal alignment scores using quadratic space under the basic global/local alignment algorithm. In this paper we present a comprehensive study of developing sequence alignment algorithms on the Cell exploiting its thread and data level parallelism features. First, we develop a Cell implementation that computes optimal alignments and adopts Hirschberg's linear space technique. The former is essential as merely computing optimal alignment scores is not useful while the latter is needed to permit alignments of longer sequences. We then present Cell implementations of two advanced alignment techniques - spliced alignments and syntenic alignments. In a spliced alignment, consecutive non-overlapping portions of a sequence align with ordered non-overlapping, but non-consecutive portions of another sequence. Spliced alignments are useful in aligning mRNA sequences with corresponding genomic sequences to uncover gene structure. Syntenic alignments are used to discover conserved exons and other sequences between long genomic sequences from different organisms. We present experimental results for these three types of alignments on the Cell BE and report speedups of about 4 on six SPUs on the Playstation 3, when compared to the respective best serial algorithms on the Cell BE and the Pentium 4 processor.
引用
收藏
页码:2047 / 2057
页数:11
相关论文
共 15 条
[1]   Parallel biological sequence comparison using prefix computations [J].
Aluru, S ;
Futamura, N ;
Mehrotra, K .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (03) :264-272
[2]  
Edmiston E., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P78
[3]   PARALLEL PROCESSING OF BIOLOGICAL SEQUENCE COMPARISON ALGORITHMS [J].
EDMISTON, EW ;
CORE, NG ;
SALTZ, JH ;
SMITH, RM .
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1988, 17 (03) :259-275
[4]  
GELFAND M, P NAT AC SCI US, P93
[5]   LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J].
HIRSCHBERG, DS .
COMMUNICATIONS OF THE ACM, 1975, 18 (06) :341-343
[6]  
HUANG X, COMPUTER APPL BIOSCI, V6
[7]   A generalized global alignment algorithm [J].
Huang, XQ ;
Chao, KM .
BIOINFORMATICS, 2003, 19 (02) :228-233
[8]  
*I CORP, CELL PROJ IBM RES
[9]  
*I MICR, CELL BROADB ENG
[10]   OPTIMAL ALIGNMENTS IN LINEAR-SPACE [J].
MYERS, EW ;
MILLER, W .
COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1988, 4 (01) :11-17