EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Finding motifs using DNA images derived from sparse representations

Shane K Chu iD, Gary D Stormo iD

Bioinformatics · 2023

DOI: 10.1093/bioinformatics/btad378 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, 2023. Verfasst von Shane K Chu und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO 63130, United States. Hauptthemen laut MEDLINE: Software, Proteins. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NIGMS NIH HHS, NIH.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Motivation Motifs play a crucial role in computational biology, as they provide valuable information about the binding specificity of proteins. However, conventional motif discovery methods typically rely on simple combinatoric or probabilistic approaches, which can be biased by heuristics such as substring-masking for multiple motif discovery. In recent years, deep neural networks have become increasingly popular for motif discovery, as they are capable of capturing complex patterns in data. Nonetheless, inferring motifs from neural networks remains a challenging problem, both from a modeling and computational standpoint, despite the success of these networks in supervised learning tasks. Results We present a principled representation learning approach based on a hierarchical sparse representation for motif discovery. Our method effectively discovers gapped, long, or overlapping motifs that we show to commonly exist in next-generation sequencing datasets, in addition to the short and enriched primary binding sites. Our model is fully interpretable, fast, and capable of capturing motifs in a large number of DNA strings. A key concept emerged from our approach—enumerating at the image level—effectively overcomes the k-mers paradigm, enabling modest computational resources for capturing the long and varied but conserved patterns, in addition to capturing the primary binding sites. Availability and implementation Our method is available as a Julia package under the MIT license at https://github.com/kchu25/MOTIFs.jl, and the results on experimental data can be found at https://zenodo.org/record/7783033.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

SoftwareProteinsBinding SitesNeural Networks, ComputerDNA

Substanzen

ProteinsDNA

Autor:innen und Institutionen

  • Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO 63130, United States.
  • Department of Genetics, Washington University School of Medicine, St. Louis, MO 63110, United States.

ORCID-Profile: Shane K Chu, Gary D Stormo

Förderung

  • NIGMS NIH HHS
  • NIH

Zitieren

APA

Chu, S. K., & Stormo, G. D. (2023). Finding motifs using DNA images derived from sparse representations. Bioinformatics. https://doi.org/10.1093/bioinformatics/btad378

Vancouver

Chu SK, Stormo GD. Finding motifs using DNA images derived from sparse representations. Bioinformatics. 2023. doi:10.1093/bioinformatics/btad378

BibTeX
@article{Chu2023,
  author = {Chu, Shane K and Stormo, Gary D},
  title = {Finding motifs using DNA images derived from sparse representations},
  journal = {Bioinformatics},
  year = {2023},
  doi = {10.1093/bioinformatics/btad378}
}
Kostenlos starten →