Year: 2014
Type: conference-paper
Abstract: Multiple sequence alignment is a fundamental tool in bioinformatics, widely used for predicting protein structure and function, reconstructing phylogeny and several other biological sequence analyses. Because it is a NP-hard problem, several studies have been conducted to propose efficient methods to solve it. Based on the well-known approximate algorithm proposed by Gusfield [8], we present two parallel solutions for this problem using the BSP/CGM model, with MPI and CUDA implementations. The results show that the use of parallel processing allows the manipulation of more and larger sequences.
Institution: Universidade Federal de Mato Grosso do Sul
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2079682109
