BioinformaticsBioinformaticsPeer-reviewed journal article
YAMDA: thousandfold speedup of EM-based motif discovery using deep learning libraries and GPU
Abstract
MotivationMotif discovery in large biopolymer sequence datasets can be computationally demanding, presenting significant challenges for discovery in omics research. MEME, arguably one of the most popular motif discovery software, takes quadratic time with respect to dataset size, leading to excessively long runtimes for large datasets. Therefore, there is a demand for fast programs that can generate results of the same quality as MEME.\n\nResultsHere we describe YAMDA, a highly scalable motif discovery software package. It is built on Pytorch, a tensor computation deep learning library with strong GPU acceleration that is highly optimized for tensor operations that are also useful for motifs. YAMDA takes linear time to find motifs as accurately as MEME, completing in seconds or minutes, which translates to speedups over a thousandfold.\n\nAvailabilityYAMDA is freely available on Github (https://github.com/daquang/YAMDA)\n\nContactdaquang@umich.edu
- assay: DNA methylation
- assay: whole-genome sequencing
- assay: whole-exome sequencing
- research focus: variant calling
- research focus: gene regulatory network inference
- research focus: differential expression
- research focus: clustering
- approach: deep learning
- approach: statistical model
- Citations
- 13
- FWCI
- 0.36
- Field percentile
- top 44%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Memes: an R interface to the MEME Suite
Spencer L. Nystrom, Daniel J. McKay·bioRxiv·Apr 23, 2021
- Motif Scraper: A cross-platform, open-source tool for identifying degenerate nucleotide motif matches in FASTA files
Elisha D. O. Roberson·BioinformaticsPeer-reviewed·May 23, 2018
- Tomtom-lite: Accelerating Tomtom enables large-scale and real-time motif similarity scoring
Jacob Matthew Schreiber·BioinformaticsPeer-reviewed·Oct 15, 2025
- Benchmarking computational tools for de novo motif discovery
Leandro Simonetti, Ylva Ivarsson, Norman E. Davey·bioRxiv·Jan 12, 2024
- Discovering motifs and genomic patterns with SMT: a high-performance data structure for counting kmers
Jader M. Caldonazzo Garbelini, Danilo Sipoli Sanches, Aurora Pozo·bioRxiv·Apr 1, 2023
- Improved Algorithms for Finding Edit Distance Based Motifs
Soumitra Pal, Sanguthevar Rajasekaran·bioRxiv·May 31, 2015