Show simple item record

AuthorAbbas, Mostafa M.
AuthorBahig, Hazem M.
AuthorAbouelhoda, Mohamed
AuthorMohie-Eldin, M.M.
Available date2016-02-28T12:50:46Z
Publication Date2014-08
Publication NameJournal of Supercomputing
CitationAbbas, M.M., Bahig, H.M., Abouelhoda, M., Mohie-Eldin, M.M., "Parallelizing exact motif finding algorithms on multi-core", (2014) Journal of Supercomputing, 69 (2), pp. 814-826.
ISSN0920-8542
URIhttp://dx.doi.org/10.1007/s11227-014-1180-3
URIhttp://hdl.handle.net/10576/4181
AbstractThe motif finding problem is one of the important and challenging problems in bioinformatics. A variety of sequential algorithms have been proposed to find exact motifs, but the running time is still not suitable due to high computational complexity of finding motifs. In this paper we parallelize three efficient sequential algorithms which are HEPPMSprune, PMS5 and PMS6. We implement the algorithms on a Dual Quad-Core machine using openMP to measure the performance of each algorithm. Our experiment on simulated data show that: (1) the parallel PMS6 is faster than the other algorithms in case of challenging instances, while the parallel HEPPMSprune is faster than the other algorithms in most of solvable instances; (2) the scalability of parallel HEPPMSprune is linear for all instances, while the scalability of parallel PMS5 and PMS6 is linear in case of challenging instances only; (3) the memory used by HEPPMSprune is less than that of the other algorithms.
SponsorNPRP Grant No. 4-1454-1-233 from the Qatar National Research Fund (a member of Qatar Foundation).
Languageen
PublisherSpringer Science+Business Media
SubjectChallenging and solvable instances
SubjectExact algorithms
SubjectMotif finding
SubjectMulti-core
TitleParallelizing exact motif finding algorithms on multi-core
TypeArticle
Pagination814-826
Issue Number2
Volume Number69


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record