It has been over a decade since the first publication of a method dedicated entirely to
mapping long-reads. The distinctive characteristics of long reads resulted in methods …

The chemical sciences are producing an unprecedented amount of large, high-dimensional
data sets containing chemical structures and associated properties. However, there are …

DNA sequencing data continue to progress toward longer reads with increasingly lower
sequencing error rates. Here, we define an algorithmic approach, mdBG, that makes use of …

As computational biologists continue to be inundated by ever increasing amounts of
metagenomic data, the need for data analysis approaches that keep up with the pace of …

A genomic sketch is a small, probabilistic representation of the set of k-mers in a sequencing
data set. Sketches are building blocks for large-scale analyses that consider similarities …

Genome search and/or classification typically involves finding the best-match database
(reference) genomes and has become increasingly challenging due to the growing number …

We propose a novel edit distance-tolerant content addressable memory (EDAM) for energy-
efficient approximate search applications. Unlike state-of-the-art approximate search …

We propose a novel dynamic storage-based approximate search content addressable
memory (DASH-CAM) for computational genomics applications, particularly for identification …

Identifying drug-target interactions (DTIs) is instructive in drug design and disease treatment.
Existing studies typically used the properties of nodes (drug chemical structure and protein …

This paper proposes a novel Hamming distance tolerant content-addressable memory (HD-
CAM) for energy-efficient in-memory approximate matching applications. HD-CAM exploits …