Biology subjects

Sachdeva, V.

Publications and source records attributed to Sachdeva, V..

4 recordsLinked to original sources

bioRxiv2024

Direct and indirect selection in a proofreading polymerase

The traits that affect evolvability are subject to indirect selection, as these traits affect the course of evolution over many generations rather than the direct replicative fitness of an individual. However, the evolution of evolvability-determining traits is often difficult to study because putative evolvability alleles often have confounding direct fitness effects of unknown origin and size. Here, we study theoretically and experimentally the evolution of mutation rates in proofreading polymerases with orthogonal control of direct and indirect selection. Mutagenic DNA polymerases enjoy a long-time fitness advantage by enhancing the rate of acquiring beneficial mutations. However, this is offset by a short-time fitness penalty, which we trace to a counterintuitive trade-off between mutation rates and activity in proofreading polymerases. Since these fitness effects act on different timescales, no one number characterizes the fitness of a mutator allele. We find unusual dynamic features in the resulting evolutionary dynamics, such as kinetic exclusion, selection by dynamic environments, and Rock-Paper-Scissors dynamics in the absence of ecology. Our work has implications for the evolution of mutation rates and more broadly, evolution in the context of an anti-correlation between mutation rates and short term fitness.

evolutionary biology↗

bioRxiv2021

Atomic-Resolution Prediction of Degrader-mediated Ternary Complex Structures by Combining Molecular Simulations with Hydrogen Deuterium Exchange

Targeted protein degradation (TPD) has emerged as a powerful approach in drug discovery for removing (rather than inhibiting) proteins implicated in diseases. A key step in this approach is the formation of an induced proximity complex, where a degrader molecule recruits an E3 ligase to the protein of interest (POI), facilitating the transfer of ubiquitin to the POI and initiating the proteasomal degradation process. Here, we address three critical aspects of the TPD process: 1) formation of the ternary complex induced by a degrader molecule, 2) conformational heterogeneity of the ternary complex, and 3) assessment of ubiquitination propensity via the full Cullin Ring Ligase (CRL) macromolecular assembly. The novel approach presented here combines experimental biophysical data--in this case hydrogen-deuterium exchange mass spectrometry (HDX-MS, which measures the solvent exposure of protein residues)--with all-atom explicit solvent molecular dynamics (MD) simulations aided by enhanced sampling techniques to predict structural ensembles of ternary complexes at atomic resolution. We present results demonstrating the efficiency, accuracy, and reliability of our approach to predict ternary structure ensembles using the bromodomain of SMARCA2 (SMARCA2BD) with the E3 ligase VHL as the system of interest. The simulations reproduce X-ray crystal structures - including prospective simulations validated on a new structure that we determined in this work (PDB ID: 7S4E) - with root mean square deviations (RMSD) of 1.1 to 1.6 [A]. The simulations also reveal a structural ensemble of low-energy conformations of the ternary complex within a broad energy basin. To further characterize the structural ensemble, we used snapshots from the aforementioned simulations as seeds for Hamiltonian replica exchange molecular dynamics (HREMD) simulations, and then perform 7.1 milliseconds of aggregate simulation time using Folding@home. The resulting free energy surface identifies the crystal structure conformation within a broad low-energy basin and the dynamic ensemble is consistent with solution-phase biophysical experimental data (HDX-MS and small-angle x-ray scattering, SAXS). Finally, we graft structures from the ternary complexes onto the full CRL and perform enhanced sampling simulations, where we find that differences in degradation efficiency can be explained by the proximity distribution of lysine residues on the POI relative to the E2-loaded ubiquitin. Several of the top predicted ubiquitinated lysine residues are validated prospectively through a ubiquitin mapping proteomics experiment.

biophysics↗

bioRxiv2020

Optimal prediction with resource constraints using the information bottleneck

Responding to stimuli requires that organisms encode information about the external world. Not all parts of the signal are important for behavior, and resource limitations demand that signals be compressed. Prediction of the future input is widely beneficial in many biological systems. We compute the trade-offs between representing the past faithfully and predicting the future for input dynamics with different levels of complexity. For motion prediction, we show that, depending on the parameters in the input dynamics, velocity or position coordinates prove more predictive. We identify the properties of global, transferrable strategies for time-varying stimuli. For non-Markovian dynamics we explore the role of long-term memory of the internal representation. Lastly, we show that prediction in evolutionary population dynamics is linked to clustering allele frequencies into non-overlapping memories, revealing a very different prediction strategy from motion prediction.

biophysics↗

bioRxiv2017

K-mer clustering algorithm using a MapReduce framework: application to the parallelization of the Inchworm module of Trinity

BackgroundDe novo transcriptome assembly is an important technique for understanding gene expression in non-model organisms. Many de novo assemblers using the de Bruijn graph of a set of the RNA sequences rely on in-memory representation of this graph. However, current methods analyse the complete set of read-derived k-mer sequence at once, resulting in the need for computer hardware with large shared memory.\n\nResultsWe introduce a novel approach that clusters k-mers as the first step. The clusters correspond to small sets of gene products, which can be processed quickly to give candidate transcripts. We implement the clustering step using the MapReduce approach for parallelising the analysis of large datasets, which enables the use of compute clusters. The computational task is distributed across the compute system, and no specialised hardware is required. Using this approach, we have re-implemented the Inchworm module from the widely used Trinity pipeline, and tested the method in the context of the full Trinity pipeline. Validation tests on a range of real datasets show large reductions in the runtime and per-node memory requirements, when making use of a compute cluster.\n\nConclusionsOur study shows that MapReduce-based clustering has great potential for distributing challenging sequencing problems, without loss of accuracy. Although we have focussed on the Trinity package, we propose that such clustering is a useful initial step for other assembly pipelines.

bioinformatics↗