Parallel algorithm for global alignment of long aminoacid and nucleotide sequences
نویسندگان
چکیده
منابع مشابه
gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملgpaligner: a fast algorithm for global pairwise alignment of dna sequences
bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...
متن کاملPaMSA: A Parallel Algorithm for the Global Alignment of Multiple Protein Sequences
Multiple sequence alignment (MSA) is a well-known problem in bioinformatics whose main goal is the identification of evolutionary, structural or functional similarities in a set of three or more related genes or proteins. We present a parallel approach for the global alignment of multiple protein sequences that combines dynamic programming, heuristics, and parallel programming techniques in an ...
متن کاملAn Alignment Algorithm for Sequences
This paper describes a new alignment algorithm for sequences that can be used for determination of deletions and substitutions. It provides several solutions out of which the best one can be chosen on the basis of minimization of gaps or other considerations. The algorithm does not use similarity tables and it performs aspects of both global and local alignment. The algorithm is compared with o...
متن کاملParallel Sequence Alignment Algorithm for Clustering System
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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Математическая биология и биоинформатика
سال: 2017
ISSN: 1994-6538
DOI: 10.17537/2017.12.137