Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Memory Matching Networks for Genomic Sequence Classification (1702.06760v1)

Published 22 Feb 2017 in cs.LG, q-bio.GN, and stat.ML

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Jack Lanchantin (21 papers)
  2. Ritambhara Singh (22 papers)
  3. Yanjun Qi (68 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.