bioRxivBioinformaticsPreprint
MINDFUL: A Method to Identify Novel and Diverse Signals with Fast, Unsupervised Learning
Abstract
With rapid advances in experimental methods that map transcription start sites (TSSs) at a high resolution, there is a need to characterize the sequence diversity of TSS neighborhoods. Most current techniques scan for previously discovered elements, such as the TATA box, the INR motif, CpG islands, etc. to categorize promoters into different classes. Reliance on such elements hinders the discovery of novel elements. On the other hand, methods that use standard motif discovery to discover de novo promoter elements are also limited by the fact that a motif is picked up only if it is over-represented in the dataset. An element that appears only in a small set of promoters can thus be missed. We previously developed a clustering-based approach that uses no prior knowledge of elements to solve this problem [1]. That method uses Gibbs sampling to learn the model parameters, but is untenable on large datasets. Here we propose a new, fast method called MINDFUL, that uses a greedy k-means-like approach to cluster promoters aligned by TSSs into diverse classes, while also learning the optimal value of k. It is general enough to be used for any data that has categorical variables, and is not restricted to DNA.
- Citations
- 0
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
- Identifying promoter sequence architectures via a chunking-based algorithm using non-negative matrix factorisation
Sarvesh Nikumbh, Boris Lenhard·PLoS Computational BiologyPeer-reviewed·Nov 20, 2023
- Unsupervised learning of DNA sequence features using a convolutional restricted Boltzmann machine
Wolfgang Kopp, Roman Schulte-Sasse·bioRxiv·Sep 5, 2017
- iPromoter-BnCNN: a novel branched CNN based predictor for identifying and classifying sigma promoters
Ruhul Amin, Chowdhury Rafeed Rahman, … Swakkhar Shatabda·BioinformaticsPeer-reviewed·Jun 24, 2020
- DeepRegFinder: Deep Learning-Based Regulatory Elements Finder
Aarthi Ramakrishnan, George Wangensteen, … Li Shen·Bioinformatics AdvancesPeer-reviewed·Jan 1, 2024
- RSAT matrix-clustering: dynamic exploration and redundancy reduction of transcription factor binding motif collections
Jaime Abraham Castro-Mondragon, Sébastien Jaeger, … Jacques van Helden·Nucleic Acids ResearchPeer-reviewed·Jun 4, 2017
- Ultra-fast and accurate motif finding in large ChIP-seq datasets reveals transcription factor binding patterns
Yang Li, Pengyu Ni, … Zhengchang Su·bioRxiv·Aug 17, 2018