Parallelizing and optimizing a hybrid differential evolution with Pareto tournaments for discovering motifs in DNA sequences

被引:3
作者
Gonzalez-Alvarez, David L. [1 ]
Vega-Rodriguez, Miguel A. [1 ]
Rubio-Largo, Alvaro [1 ]
机构
[1] Univ Extremadura, ARCO Res Grp, Dept Technol Comp & Commun, Escuela Politecn, Caceres 10003, Spain
关键词
Parallelism; Hybrid algorithm; Differential evolution; Multiobjective optimization; Motif discovery; MULTIOBJECTIVE GENETIC ALGORITHM; BINDING-SITES; ALIGNMENT; IMPLEMENTATION; OPTIMIZATION; HARDWARE;
D O I
10.1007/s11227-014-1266-y
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Transcriptional regulation is the main regulation of gene expression, the process by which all prokaryotic organisms and eukaryotic cells transform the information encoded by the nucleic acids (DNA) into the proteins required for their operation and development. A crucial component in genetic regulation is the bindings between transcription factors and DNA sequences that regulate the expression of genes. These specific locations are short and share a common sequence of nucleotides. The discovery of these small DNA strings, also known as motifs, is labor intensive and therefore the use of high-performance computing can be a good way to address it. In this work, we present a parallel multiobjective evolutionary algorithm, a novel hybrid technique based on differential evolution with Pareto tournaments (H-DEPT). To study whether this algorithm is suitable to be parallelized, H-DEPT has been used to solve instances of different sizes on several multicore systems (2, 4, 8, 16, and 32 cores). As we will see, the results show that H-DEPT achieves good speedups and efficiencies. We also compare the predictions made by H-DEPT with those predicted by other biological tools demonstrating that it is also capable of performing quality predictions.
引用
收藏
页码:880 / 905
页数:26
相关论文
共 53 条
[31]   An algorithm for finding protein-DNA binding sites with applications to chromatin-immunoprecipitation microarray experiments [J].
Liu, XS ;
Brutlag, DL ;
Liu, JS .
NATURE BIOTECHNOLOGY, 2002, 20 (08) :835-839
[32]   CUDA-MEME: Accelerating motif discovery in biological sequences using CUDA-enabled graphics processing units [J].
Liu, Yongchao ;
Schmidt, Bertil ;
Liu, Weiguo ;
Maskell, Douglas L. .
PATTERN RECOGNITION LETTERS, 2010, 31 (14) :2170-2177
[33]  
Mak TST, 2004, 2004 IEEE COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE, PROCEEDINGS, P512
[34]   GIBBS MOTIF SAMPLING - DETECTION OF BACTERIAL OUTER-MEMBRANE PROTEIN REPEATS [J].
NEUWALD, AF ;
LIU, JS ;
LAWRENCE, CE .
PROTEIN SCIENCE, 1995, 4 (08) :1618-1632
[35]   SAGA: Sequence alignment by genetic algorithm [J].
Notredame, C ;
Higgins, DG .
NUCLEIC ACIDS RESEARCH, 1996, 24 (08) :1515-1524
[36]   Using reconfigurable hardware to accelerate multiple sequence alignment with ClustalW [J].
Oliver, T ;
Schmidt, B ;
Nathan, D ;
Clemens, R ;
Maskell, D .
BIOINFORMATICS, 2005, 21 (16) :3431-3432
[37]  
Qin J., 2005, PROC PARALLEL DISTRI, P601
[38]   Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation [J].
Roth, FP ;
Hughes, JD ;
Estep, PW ;
Church, GM .
NATURE BIOTECHNOLOGY, 1998, 16 (10) :939-945
[39]  
Rubio-Largo A, 2013, COMMENTARIOS LIBROS, P1
[40]  
Sandve GK, 2006, LECT NOTES COMPUT SC, V4175, P197