Browse
Submit Data
Databases
API
Help

Dataset Information

15 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A Free-Energy Landscape Analysis of Calmodulin Obtained from an NMR Data-Utilized Multi-Scale Divide-and-Conquer Molecular Dynamics Simulation.

ABSTRACT: Calmodulin (CaM) is a multifunctional calcium-binding protein, which regulates a variety of biochemical processes. CaM acts through its conformational changes and complex formation with its target enzymes. CaM consists of two globular domains (N-lobe and C-lobe) linked by an extended linker region. Upon calcium binding, the N-lobe and C-lobe undergo local conformational changes, followed by a major conformational change of the entire CaM to wrap the target enzyme. However, the regulation mechanisms, such as allosteric interactions, which regulate the large structural changes, are still unclear. In order to investigate the series of structural changes, the free-energy landscape of CaM was obtained by multi-scale divide-and-conquer molecular dynamics (MSDC-MD). The resultant free-energy landscape (FEL) shows that the Ca²⁺ bound CaM (holo-CaM) would take an experimentally famous elongated structure, which can be formed in the early stage of structural change, by breaking the inter-domain interactions. The FEL also shows that important interactions complete the structural change from the elongated structure to the ring-like structure. In addition, the FEL might give a guiding principle to predict mutational sites in CaM. In this study, it was demonstrated that the movement process of macroscopic variables on the FEL may be diffusive to some extent, and then, the MSDC-MD is suitable to the parallel computation.

SUBMITTER: Shimoyama H

PROVIDER: S-EPMC8617919 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Divide-and-conquer strategy for large-scale Eulerian solvent excluded surface.

Project description:MotivationSurface generation and visualization are some of the most important tasks in biomolecular modeling and computation. Eulerian solvent excluded surface (ESES) software provides analytical solvent excluded surface (SES) in the Cartesian grid, which is necessary for simulating many biomolecular electrostatic and ion channel models. However, large biomolecules and/or fine grid resolutions give rise to excessively large memory requirements in ESES construction. We introduce an out-of-core and parallel algorithm to improve the ESES software.ResultsThe present approach drastically improves the spatial and temporal efficiency of ESES. The memory footprint and time complexity are analyzed and empirically verified through extensive tests with a large collection of biomolecule examples. Our results show that our algorithm can successfully reduce memory footprint through a straightforward divide-and-conquer strategy to perform the calculation of arbitrarily large proteins on a typical commodity personal computer. On multi-core computers or clusters, our algorithm can reduce the execution time by parallelizing most of the calculation as disjoint subproblems. Various comparisons with the state-of-the-art Cartesian grid based SES calculation were done to validate the present method and show the improved efficiency. This approach makes ESES a robust software for the construction of analytical solvent excluded surfaces.Availability and implementationhttp://weilab.math.msu.edu/ESES.

| S-EPMC6641554 | biostudies-literature

Divide and Conquer: A Tailored Solid-state NMR Approach to Study Large Membrane Protein Complexes.

Project description:Membrane proteins are known to exert many essential biological functions by forming complexes in cell membranes. An example refers to the β-barrel assembly machinery (BAM), a 200 kDa pentameric complex containing BAM proteins A-E that catalyzes the essential process of protein insertion into the outer membrane of gram-negative bacteria. While progress has been made in capturing three-dimensional structural snapshots of the BAM complex, the role of the lipoprotein BamC in the complex assembly in functional lipid bilayers has remained unclear. We have devised a component-selective preparation scheme to directly study BamC as part of the entire BAM complex in lipid bilayers. Combination with proton-detected solid-state NMR methods allowed us to probe the structure, dynamics, and supramolecular topology of full-length BamC embedded in the entire complex in lipid bilayers. Our approach may help decipher how individual proteins contribute to the dynamic formation and functioning of membrane protein complexes in membranes.

| S-EPMC9540533 | biostudies-literature

Precision Oncology in Sarcomas: Divide and Conquer.

Project description:Sarcomas are a heterogeneous group of rare malignancies that exhibit remarkable heterogeneity, with more than 50 subtypes recognized. Advances in next-generation sequencing technology have resulted in the discovery of genetic events in these mesenchymal tumors, which in addition to enhancing understanding of the biology, have opened up avenues for molecularly targeted therapy and immunotherapy. This review focuses on how incorporation of next-generation sequencing has affected drug development in sarcomas and strategies for optimizing precision oncology for these rare cancers. In a significant percentage of soft tissue sarcomas, which represent up to 40% of all sarcomas, specific driver molecular abnormalities have been identified. The challenge to evaluate these mutations across rare cancer subtypes requires the careful characterization of these genetic alterations to further define compelling drivers with therapeutic implications. Novel models of clinical trial design also are needed. This shift would entail sustained efforts by the sarcoma community to move from one-size-fits-all trials, in which all sarcomas are treated similarly, to divide-and-conquer subtype-specific strategies.

| S-EPMC7446356 | biostudies-literature

Divide and conquer: enriching environmental sequencing data.

Project description:BackgroundIn environmental sequencing projects, a mix of DNA from a whole microbial community is fragmented and sequenced, with one of the possible goals being to reconstruct partial or complete genomes of members of the community. In communities with high diversity of species, a significant proportion of the sequences do not overlap any other fragment in the sample. This problem will arise not only in situations with a relatively even distribution of many species, but also when the community in a particular environment is routinely dominated by the same few species. In the former case, no genomes may be assembled at all, while in the latter case a few dominant species in an environment will always be sequenced at high coverage to the detriment of coverage of the greater number of sparse species.Methods and resultsHere we show that, with the same global sequencing effort, separating the species into two or more sub-communities prior to sequencing can yield a much higher proportion of sequences that can be assembled. We first use the Lander-Waterman model to show that, if the expected percentage of singleton sequences is higher than 25%, then, under the uniform distribution hypothesis, splitting the community is always a wise choice. We then construct simulated microbial communities to show that the results hold for highly non-uniform distributions. We also show that, for the distributions considered in the experiments, it is possible to estimate quite accurately the relative diversity of the two sub-communities.ConclusionGiven the fact that several methods exist to split microbial communities based on physical properties such as size, density, surface biochemistry, or optical properties, we strongly suggest that groups involved in environmental sequencing, and expecting high diversity, consider splitting their communities in order to maximize the information content of their sequencing effort.

| S-EPMC1952108 | biostudies-literature

A fast divide-and-conquer sparse Cox regression.

Project description:We propose a computationally and statistically efficient divide-and-conquer (DAC) algorithm to fit sparse Cox regression to massive datasets where the sample size $n_0$ is exceedingly large and the covariate dimension $p$ is not small but $n_0\gg p$. The proposed algorithm achieves computational efficiency through a one-step linear approximation followed by a least square approximation to the partial likelihood (PL). These sequences of linearization enable us to maximize the PL with only a small subset and perform penalized estimation via a fast approximation to the PL. The algorithm is applicable for the analysis of both time-independent and time-dependent survival data. Simulations suggest that the proposed DAC algorithm substantially outperforms the full sample-based estimators and the existing DAC algorithm with respect to the computational speed, while it achieves similar statistical efficiency as the full sample-based estimators. The proposed algorithm was applied to extraordinarily large survival datasets for the prediction of heart failure-specific readmission within 30 days among Medicare heart failure patients.

| S-EPMC8036003 | biostudies-literature

Divide-and-Conquer Hartree-Fock Calculations on Proteins.

Project description:The ability to perform ab initio electronic structure calculations that scales linearly with the system size is one of the central aims in theoretical chemistry. In this study, the implementation of the divide-and-conquer (DC) algorithm, an algorithm with the potential to aid the achievement of true linear scaling within Hartree-Fock (HF) theory is revisited. Standard HF calculations solve the Roothaan-Hall equations for the whole system; in the DC-HF approach, the diagonalization of the Fock matrix is carried out on smaller subsystems. The DC algorithm for HF calculations was validated on polyglycines, polyalanines and eleven real three-dimensional proteins of up to 608 atoms in this work. We also found that a fragment-based initial guess using molecular fractionation with conjugated caps (MFCC) method significantly reduces the number of SCF cycles and even is capable of achieving convergence for some globular proteins where the simple superposition of atomic densities (SAD) initial guess fails.

| S-EPMC2853773 | biostudies-literature

Strategies for aggressive T-cell lymphoma: divide and conquer.

Project description:The aggressive peripheral T-cell lymphomas (PTCLs) are a heterogenous group of uncommon lymphomas of mature T lymphocytes dominated by 3 subtypes: systemic anaplastic large-cell lymphoma, both anaplastic lymphoma kinase positive and negative; nodal PTCL with T-follicular helper phenotype; and PTCL, not otherwise specified. Although the accurate diagnosis of T-cell lymphoma and the subtyping of these lymphomas may be challenging, there is growing evidence that knowledge of the subtype of disease can aid in prognostication and in the selection of optimal treatments, in both the front-line and the relapsed or refractory setting. This report focuses on the 3 most common subtypes of aggressive PTCL, to learn how current knowledge may dictate choices of therapy and consultative referrals and inform rational targets and correlative studies in the development of future clinical trials. Finally, I note that clinical-pathologic correlation, especially in cases of T-cell lymphomas that may present with an extranodal component, is essential in the accurate diagnosis and subsequent treatment of our patients.

| S-EPMC7727519 | biostudies-literature

Divide and conquer? Size adjustment with allometry and intermediate outcomes.

Project description:Many trait measurements are size-dependent, and while we often divide these traits by size before fitting statistical models to control for the effect of size, this approach does not account for allometry and the intermediate outcome problem. We describe these problems and outline potential solutions.

| S-EPMC5679152 | biostudies-literature

Kart: a divide-and-conquer algorithm for NGS read alignment.

Project description:MotivationNext-generation sequencing (NGS) provides a great opportunity to investigate genome-wide variation at nucleotide resolution. Due to the huge amount of data, NGS applications require very fast and accurate alignment algorithms. Most existing algorithms for read mapping basically adopt seed-and-extend strategy, which is sequential in nature and takes much longer time on longer reads.ResultsWe develop a divide-and-conquer algorithm, called Kart, which can process long reads as fast as short reads by dividing a read into small fragments that can be aligned independently. Our experiment result indicates that the average size of fragments requiring the more time-consuming gapped alignment is around 20 bp regardless of the original read length. Furthermore, it can tolerate much higher error rates. The experiments show that Kart spends much less time on longer reads than other aligners and still produce reliable alignments even when the error rate is as high as 15%.Availability and implementationKart is available at https://github.com/hsinnan75/Kart/ .Contacthsu@iis.sinica.edu.tw.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC5860120 | biostudies-literature

Likelihood Inference for Large Scale Stochastic Blockmodels with Covariates based on a Divide-and-Conquer Parallelizable Algorithm with Communication.

Project description:We consider a stochastic blockmodel equipped with node covariate information, that is helpful in analyzing social network data. The key objective is to obtain maximum likelihood estimates of the model parameters. For this task, we devise a fast, scalable Monte Carlo EM type algorithm based on case-control approximation of the log-likelihood coupled with a subsampling approach. A key feature of the proposed algorithm is its parallelizability, by processing portions of the data on several cores, while leveraging communication of key statistics across the cores during each iteration of the algorithm. The performance of the algorithm is evaluated on synthetic data sets and compared with competing methods for blockmodel parameter estimation. We also illustrate the model on data from a Facebook derived social network enhanced with node covariate information.

| S-EPMC6781626 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data