Abstract Motivation We introduce SneakySnake, a highly parallel and highly accurate pre-
alignment filter that remarkably reduces the need for computationally costly sequence …

Motivation The ability to generate massive amounts of sequencing data continues to
overwhelm the processing capability of existing algorithms and compute infrastructures. In …

The proliferation of high-throughput sequencing machines ensures rapid generation of up to
billions of short nucleotide fragments in a short period of time. This massive amount of …

It is crucial to detect potential overlaps between any pair of the input reads and a reference
genome in genome sequencing, but it takes an excessive amount of time, especially for ultra …

A WD40 protein typically contains four or more repeats of~ 40 residues ended with the Trp-
Asp dipeptide, which folds into β-propellers with four β strands in each repeat. They often …

This paper discovers the major shortcomings of the Levenshtein Distance method, the
longest common subsequence (LCS) method, and other general approaches to finding …

arXiv:2009.09787v1 [cs.AR] 21 Sep 2020 Page 1 A high-performance MEMRISTOR-based
Smith-Waterman DNA sequence alignment Using FPNI structure Mahdi Taheria , Hamed …

Large-scale computing systems rely on many control and decision-making algorithms.
Classical approaches to designing and optimizing these algorithms are poorly suited to the …

Выразительные примеры показывают, что нормализация меры сходства, равно как и
замена её метрикой могут приводить к ошибкам кластеризации и ранжирования по …

The computation of protein sequence alignments is one of the most fundamental tasks in
computational biology. Pairwise sequence alignments (PSA) form the basis for the detection …