Log In Sign Up

Memory Matching Networks for Genomic Sequence Classification

by   Jack Lanchantin, et al.

When analyzing the genome, researchers have discovered that proteins bind to DNA based on certain patterns of the DNA sequence known as "motifs". However, it is difficult to manually construct motifs due to their complexity. Recently, externally learned memory models have proven to be effective methods for reasoning over inputs and supporting sets. In this work, we present memory matching networks (MMN) for classifying DNA sequences as protein binding sites. Our model learns a memory bank of encoded motifs, which are dynamic memory modules, and then matches a new test sequence to each of the motifs to classify the sequence as a binding or nonbinding site.


Estimation of Similarity between DNA Sequences and Its Graphical Representation

Bioinformatics, which is now a well known field of study, originated in ...

DNA Pattern Matching Acceleration with Analog Resistive CAM

DNA pattern matching is essential for many widely used bioinformatics ap...

Unsupervised Representation Learning of DNA Sequences

Recently several deep learning models have been used for DNA sequence ba...

Dilated Convolutions for Modeling Long-Distance Genomic Dependencies

We consider the task of detecting regulatory elements in the human genom...

BioSEAL: In-Memory Biological Sequence Alignment Accelerator for Large-Scale Genomic Data

Genome sequences contain hundreds of millions of DNA base pairs. Finding...

Knowledge distillation for fast and accurate DNA sequence correction

Accurate genome sequencing can improve our understanding of biology and ...

Eliminating unwanted patterns with minimal interference

Artificial synthesis of DNA molecules is an essential part of the study ...