CCES Unicamp

Parallel Computation for the All-Pairs Su x-Prefix Problem

We show how to parallelize the optimal algorithm proposed by Tustumi et al. [19] to solve the all-pairs su x-prefix matching problem for general alphabets. We compared our parallel algorithm with SOF [17], a practical solution for DNA sequences that exhibits good time and space performance in multithreading environments. The experimental results showed that our parallel algorithm achieves a consistent speedup when compared with the sequential algorithm, and it is competitive with SOF when the minimum overlap length is small.
Parallel Computation for the All-Pairs Su x-Prefix Problem

Full Article URL:

We show how to parallelize the optimal algorithm proposed by Tustumi et al. [19] to solve the all-pairs su x-prefix matching problem for general alphabets. We compared our parallel algorithm with SOF [17], a practical solution for DNA sequences that exhibits good time and space performance in multithreading environments. The experimental results showed that our parallel algorithm achieves a consistent speedup when compared with the sequential algorithm, and it is competitive with SOF when the minimum overlap length is small.

Related posts

FluidFreeEnergyforLAMMPS: Nonequilibrium Free-Energy Calculations of Fluids using LAMMPS

cces cces

CCES student wins Best Theoretical Chemistry Poster Award at the 42nd Annual Meeting of the Brazilian Chemistry Society.

cces cces

Unraveling the complex genome of Saccharum spontaneum using Polyploid Gene Assembler

cces cces