Hardware accelerators are becoming increasingly commonplace in delivering high
performance computing solutions at a fraction of the cost of conventional supercomputers …

Given a video or time series of skeleton data, action recognition systems perform
classification using cues such as motion, appearance, and pose. For the past decade …

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 …

Aligning DNA sequences to an annotated reference is a key step for genotyping in biology.
Recent scientific studies have demonstrated improved inference by aligning reads to a …

We present the first space and time optimal parallel algorithm for the pairwise sequence
alignment problem, a fundamental problem in computational biology. This problem can be …

The most pervasive compute operation carried out in almost all bioinformatics applications is
pairwise sequence homology detection (or sequence alignment). Due to exponentially …

Biological sequence comparison is an important tool for researchers in molecular biology.
There are several algorithms for sequence comparison. The Smith-Waterman algorithm …

Cross-species chromosome alignments can reveal ancestral relationships and may be used
to identify the peculiarities of the species. It is thus an important problem in Bioinformatics …

Topics in Parallel and Distributed Computing Sushil K. Prasad· Anshul Gupta Arnold
Rosenberg· Alan Sussman Charles Weems Editors Topics in Parallel and Distributed …

This paper proposes an efficient parallel algorithm for an important class of dynamic
programming problems that includes Viterbi, Needleman-Wunsch, Smith-Waterman, and …