Parallelization of protein clustering algorithm using OpenMP

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Proteins are the building blocks of all living organisms and its analysis can help us to understand the bimolecular mechanics of living organisms. Protein clustering attempts to group similar protein sequences and has diverse applications in bioinformatics. However, this operation faces various computational challenges because of dependency on complex data structures, high memory usage and irregular memory access patterns. In genome studies, the time consideration for alignment is also an important parameter and should be minimized. Conventional solutions have rather been unsuccessful in achieving decent runtime performance because these algorithms are designed for serial computation which means that they use a single processor to perform computations. These algorithms can be improved upon by modifying them to use multiple processing elements. The purpose of this research is to modify existing protein clustering algorithm and apply parallelization techniques on them in order to optimize protein sequencing operation for faster results without sacrificing accuracy.

Cite

CITATION STYLE

APA

Dhar, D., Hegde, L., Patil, M. S., & Chickerur, S. (2018). Parallelization of protein clustering algorithm using OpenMP. In Communications in Computer and Information Science (Vol. 906, pp. 108–118). Springer Verlag. https://doi.org/10.1007/978-981-13-1813-9_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free