Biology subjects

Bhati, U.

Publications and source records attributed to Bhati, U..

3 recordsLinked to original sources

bioRxiv2025

Decoding stress specific transcriptional regulation by causality aware Graph-Transformer deep learning

Cells respond to environmental stimuli through transcriptional reprogramming orchestrated by transcription factors (TFs), which interpret cis-regulatory DNA sequences to determine the timing and location of gene expression. The diversification of TFs and their interactions with cis-regulatory elements (CREs) underpins plant adaptation to stress through the formation of gene regulatory networks (GRNs). However, deciphering condition-specific GRNs and identifying transcription factor binding motifs (TFBMs) for spatio-temporal gene expression remain major challenges in plant biology. To decipher the conditional networks governing TF-Target gene interactions, we developed CTF-BIND, a novel computational framework designed to reason about the spatio-temporal dynamics of TF activity. Leveraging over [~]23TB of multi-omics data (ChIP-seq, RNA-seq, and protein-protein interaction data), we constructed Bayesian causal networks capable of explaining TF activity across diverse conditions. These networks, validated against extensive experimental data, were then integrated into a Graph Transformer deep learning system. This system uses expression information of network components to quantitatively determine TF activity levels. Models were developed for 110 abiotic stress-related TFs, enabling accurate condition-specific detection of TF binding directly from RNA-seq data, eliminating the need for separate ChIP-seq experiments. CTF-BIND achieved a high average accuracy of [~]93% when tested against experimentally established data from various conditions. It is implemented as an interactive, open-access web server, it not only provides TF binding profiles but also facilitates downstream functional analysis. Furthermore, we developed CTF-BIND-DB, (https://hichicob.ihbt.res.in/ctfbind/) a database capturing dynamic shifts in regulatory pathways, providing information on TGs, network ontology, and binding motifs. CTF-BIND and CTF-BIND-DB represent a transformative approach for understanding and determining TF activity in plant stress responses, offering a powerful tool for crop improvement and bypassing the limitations of traditional methods and extensive experimental validation.

bioinformatics↗

bioRxiv2024

PTF-Vac: Ab-initio discovery of plant transcription factors binding sites using deep co-learning encoders-decoders

Discovery of transcription factors (TFs) binding sites (TFBS) and their motifs in plants pose significant challenges due to high cross-species variability. The interaction between TFs and their binding sites is highly specific and context dependent. Most of the existing TFBS finding tools are not accurate enough to discover these binding sites in plants. They fail to capture the cross-species variability, interdependence between TF structure and its TFBS, and context specificity of binding. Since they are coupled to predefined TF specific model/matrix, they are highly vulnerable towards the volume and quality of data provided to build the motifs. All these software make a presumption that the user input would be specific to any particular TF which renders them of very limited use for practical applications like genomic annotations of newly sequenced species. Here, we report an explainable Deep Encoders-Decoders generative system, PTF-V[a]c, founded on a universal model of deep co-learning on variability in binding sites and TF structure, PTFSpot, making it completely free from the bottlenecks mentioned above. It has successfully decoupled the process of TFBS discovery from the prior step of motif finding and requirement of TF specific motif models. Due to the universal model for TF:DNA interactions as its guide, it can discover the binding motifs in total independence from data volume, species and TF specific models. In a comprehensive benchmarking study across a huge volume of experimental data, it has outperformed most advanced motif finding deep learning (DL) algorithms. With this all, PTF-V[a]c brings a completely new chapter in ab-initio TFBS discovery through generative AI. Short SummaryThe discovery of transcription factor binding sites (TFBS) in plants is challenging due to high variability across species and context-specific interactions. Traditional tools rely on predefined models and often fail in their cross-species applications. PTF-V[a]c has implemented generative a universal deep-learning model that decouples TFBS discovery from predefined motifs, enabling accurate, species-independent TFBS/motif identification while outperforming existing methods by huge leads.

bioinformatics↗

bioRxiv2023

Deep Co-learning on transcription factors and their binding sites attains impeccable universality in plants

Unlike animals, variability in transcription factors (TF) and their binding regions (TFBR) across the plants species is a major problem which most of the existing TFBR finding software fail to tackle, rendering them hardly of any use. This limitation has resulted into underdevelopment of plant regulatory research and rampant use of Arabidopsis like model species, generating misleading results. Here we report a revolutionary transformers based deep-learning approach, PTFSpot, which learns from TF structures and their binding regions co-variability to bring a universal TF-DNA interaction model to detect TFBR with complete freedom from TF and species specific models limitations. During a series of extensive benchmarking studies over multiple experimentally validated data, it not only outperformed the existing software by >30% lead, but also delivered consistently >90% accuracy even for those species and TF families which were never encountered during model building process. PTFSpot makes it possible now to accurately annotate TFBRs across any plant genome even in the total lack of any TF information, completely free from the bottlenecks of species and TF specific models.

bioinformatics↗