Automated Incorporation of Pairwise Dependency in Transcription Factor Binding Site Prediction Using Dinucleotide Weight Tensors
Saeed OmidiiD, Mihaela ZavolaniD, Mikhail V. PachkoviD, Jérémie BredaiD, Severin BergeriD, Erik van NimwegeniD
Abstract
Gene regulatory networks are ultimately encoded by the sequence-specific binding of (TFs) to short DNA segments. Although it is customary to represent the binding specificity of a TF by a position-specific weight matrix (PSWM), which assumes each position within a site contributes independently to the overall binding affinity, evidence has been accumulating that there can be significant dependencies between positions. Unfortunately, methodological challenges have so far hindered the development of a practical and generally-accepted extension of the PSWM model. On the one hand, simple models that only consider dependencies between nearest-neighbor positions are easy to use in practice, but fail to account for the distal dependencies that are observed in the data. On the other hand, models that allow for arbitrary dependencies are prone to overfitting, requiring regularization schemes that are difficult to use in practice for non-experts.\n\nHere we present a new regulatory motif model, called dinucleotide weight tensor (DWT), that incorporates arbitrary pairwise dependencies between positions in binding sites, rigorously from first principles, and free from tunable parameters. We demonstrate the power of the method on a large set of ChIP-seq data-sets, showing that DWTs outperform both PSWMs and motif models that only incorporate nearest-neighbor dependencies. We also demonstrate that DWTs outperform two previously proposed methods. Finally, we show that DWTs inferred from ChIP-seq data also outperform PSWMs on HT-SELEX data for the same TF, suggesting that DWTs capture inherent biophysical properties of the interactions between the DNA binding domains of TFs and their binding sites.\n\nWe make a suite of DWT tools available at dwt.unibas.ch, that allow users to automatically perform motif finding, i.e. the inference of DWT motifs from a set of sequences, binding site prediction with DWTs, and visualization of DWT dilogo motifs.\n\nAuthor SummaryGene regulatory networks are ultimately encoded in constellations of short binding sites in the DNA and RNA that are recognized by regulatory factors such as transcription factors (TFs). For several decades, computational analysis of regulatory networks has relied on a model of TF sequence-specificity, the position-specific weight-matrix (PSWM), that assumes different positions in a binding site contribute independently to the total binding energy of the TF. However, in recent years evidence has been accumulating that, at least for some TFs, this assumption does not hold. Here we present a new model for the sequence-specificity of TFs, the dinucleotide weight tensor (DWT), that takes arbitrary dependencies between positions in binding sites into account and show that it consistently outperforms PSWMs on high-throughput datasets on TF binding. Moreover, in contrast to previous approaches, DWTs are directly derived from first principles within a Bayesian framework, and contain no tunable parameters. This allows them to be easily applied in practice and we make a suite of tools available for computational analysis with DWTs.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 15
- FWCI
- 0.89
- Field percentile
- top 28%
- Assay
- Research Focus
- Approach
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
- Classic machine learning on top of multiple position weight matrices improves genomic prediction of transcription factor binding sites
Pavel Kravchenko, Ilya E. Vorontsov, … Dmitry Penzar·bioRxiv·May 14, 2026
- DNA shape complements sequence-based representations of transcription factor binding sites
Peter DeFord, James Taylor·bioRxiv·Jun 17, 2019
- Bayesian Markov models improve the prediction of binding motifs beyond first order
Wanwan Ge, Markus Meier, … Johannes Söding·NAR Genomics and BioinformaticsPeer-reviewed·Apr 9, 2021
- Representing Transcription Factor Dimer Binding Sites Using Forked-Position Weight Matrices and Forked-Sequence Logos
Matthew Dyer, Roberto Tirado-Magallanes, … Touati Benoukraf·bioRxiv·Jul 16, 2024
- Deep Learning of High-throughput Transcription Factor-DNA Binding Affinity Data: Quantitative Comparison with Pairwise-Additive Models
Ke Shen, Zi Wang, Xiaoliang Sunney Xie·bioRxiv·May 19, 2026
- Base-resolution models of transcription factor binding reveal soft motif syntax
Žiga Avsec, Melanie Weilert, … Julia Zeitlinger·Nature GeneticsPeer-reviewed·Feb 18, 2021