Name
Abstract | ||
|---|---|---|
In this paper, we propose and evaluate a parallel solution for the exact Multiple Sequence Alignment problem based on the A-Star algorithm. In our parallel solution, we use a multi-index data structure, templates and a locality-sensitive hash function. The results were collected in two machines (4 cores and 32 cores), with real and synthetic sequence sets ranging from 3 to 14 sequences. We show that our parallel solution executes 2.89× and 4.77× faster than a state-of-the-art parallel MSA tool, with a proportional increase in memory usage, when comparing 2 hard instances of the benchmark Bali base reference set 1. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CISIS.2015.50 | 2015 Ninth International Conference on Complex, Intelligent, and Software Intensive Systems |
Keywords | Field | DocType |
Multiple Sequence Alignment,Multicore parallel programming,A-Star | Data structure,Locality,Computer science,Instruction set,Parallel computing,Ranging,Memory management,Hash function,Multiple sequence alignment,A* search algorithm,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Sundfeld | 1 | 5 | 1.87 |
| George Teodoro | 2 | 150 | 22.18 |
| Alba Cristina Magalhaes Alves De Melo | 3 | 253 | 33.90 |