@inproceedings{687d0235b1a34007824e82d90d68513e,
title = "Development of MapReduce and MPI programs for motif search",
abstract = "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.",
keywords = "Algorithm, MPI, MapReduce, Motif, Parallel processing",
author = "Mejdl Safran and Saad Al-Qahtani and Michelle Zhu and Dunren Che",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Conference on Cluster Computing, CLUSTER 2015 ; Conference date: 08-09-2015 Through 11-09-2015",
year = "2015",
month = oct,
day = "26",
doi = "10.1109/CLUSTER.2015.82",
language = "English",
series = "Proceedings - IEEE International Conference on Cluster Computing, ICCC",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "500--501",
booktitle = "Proceedings - 2015 IEEE International Conference on Cluster Computing, CLUSTER 2015",
}