Name
Title | ||
|---|---|---|
Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM Model |
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2560683.2560698 | PMAM |
Keywords | DocType | ISBN |
cgm model,efficient parallel implementations,multiple sequence alignment,cuda implementation,parallel solution,efficient method,larger sequence,biological sequence analysis,parallel processing,np-hard problem,fundamental tool | Conference | 978-1-4503-2657-5 |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jucele F. A. Vasconcellos | 1 | 1 | 0.36 |
| Christiane Nishibe | 2 | 8 | 1.53 |
| Nalvo F. Almeida | 3 | 5 | 4.94 |
| Edson Norberto Cáceres | 4 | 29 | 7.30 |