Development of MapReduce and MPI Programs for Motif Search

Conference Paper
Safran, Mejdl . 2015
الوسوم: 
MapReduce, MPI, Motif Search, Hadoop, Parallel, Concurrency, Cluster computing
اسم المؤتمر: 
IEEE International Conference on Cluster Computing (CLUSTER)
عنوان المؤتمر: 
Chicago, IL, USA
تاريخ المؤتمر: 
الخميس, تشرين اﻷول (أكتوبر) 29, 2015
مستخلص المنشور: 

As one of the important problems in molecular biology, motif search is computationally expensive, especially when the size of DNA sequences is large. Extended from a graduate course project in parallel and distributed computing (PDC), this paper investigates two different programming frameworks, namely MapReduce and MPI on motif finding. We implemented a serial algorithm, a MapReduce based algorithm, and a MPI program to calculate the best motif in given DNA sequences. The experimental results demonstrate that our MPI program outperformed both the MapReduce-based algorithm and the serial program with superior efficiency.

ملف مرفق: 
المرفقالحجم
PDF icon motif-search-mapreduce-mpi1.pdf145.38 كيلوبايت