Parallel sequence alignment algorithm for clustering system

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Sequence alignment is one of the most important fundamental operations in bioinformatics. It has been successfully applied to predict the function, structure and evolution of biological sequences. In this paper, the sequence alignment algorithms based on dynamic programming are analyzed and compared. We present a parallel algorithm for pairwise alignment and implement it on a clustering system with MPI. The experimental results demonstrate the effectiveness in performance promotion. We encapsulate the algorithm into a grid service for practical use. © 2006 International Federation for Information Processing.

Cite

CITATION STYLE

APA

Chen, Y., Yu, S., & Leng, M. (2006). Parallel sequence alignment algorithm for clustering system. In IFIP International Federation for Information Processing (Vol. 207, pp. 311–321). https://doi.org/10.1007/0-387-34403-9_43

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