A parallel GPU-designed algorithm for the constrained multiple sequence alignment problem

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

Abstract

Modern graphical processing units (GPUs) offer much more computational power than modern CPUs, so it is natural that GPUs are often used for solving many computationally-intensive problems. One of the tasks of huge importance in bioinformatics is sequence alignment. We investigate its variant introduced a few years ago in which some additional requirement on the alignment is given. As a result we propose a parallel version of Center-Star algorithm computing the constrained multiple sequence alignment at the GPU. The obtained speedup over the serial CPU relative is in range [20, 200]. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gudyś, A., & Deorowicz, S. (2011). A parallel GPU-designed algorithm for the constrained multiple sequence alignment problem. Advances in Intelligent and Soft Computing, 103, 361–368. https://doi.org/10.1007/978-3-642-23169-8_39

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