Many bioinformatics applications, such as the optimal pairwise biological sequence
comparison, demand a great quantity of computing resource, thus are excellent candidates …

The serverless computing model has been on the rise in recent years due to a lower barrier
to entry and elastic scalability. However, our experimental evidence suggests that multiple …

This paper proposes and evaluates CUDAlign 4.0, a parallel strategy to obtain the optimal
alignment of huge DNA sequences in multi-GPU platforms, using the exact Smith–Waterman …

In Genome Projects, biological sequences are aligned thousands of times, in a daily basis.
The Smith-Waterman algorithm is able to retrieve the optimal local alignment with quadratic …

For biological applications, sequence alignment is an important strategy to analyze DNA
and protein sequences. Multiple sequence alignment is an essential methodology to study …

Several modeling techniques exist to represent agent interaction protocols mostly based on
work done in distributed systems. These modeling techniques do not take the agent features …

Sequence alignment is a critical computational problem in various domains, including
genomics, proteomics, and natural language processing. The Needleman‐Wunsch (NW) …

This paper proposes and evaluates a parallel strategy to execute the exact Smith-Waterman
(SW) biological sequence comparison algorithm for huge DNA sequences in multi-GPU …

Biological sequence alignment is a very popular application in Bioinformatics, used routinely
worldwide. Many implementations of biological sequence alignment algorithms have been …

Sequence alignment based on dynamic programming, eg, Smith-Waterman (SW), remains
central to bioinformatics both in various standalone scenarios and as a function in other …