检索结果-内蒙古大学图书馆

Identifying the minimal sets of distance restraints for FRET-assisted protein structural modeling

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Zhuoyi Grigas, Alex T. Sumner, Jacob Knab, Edward Davis, Caitlin M. O’Hern, Corey S. Department of Mechanical Engineering and Materials Science Yale University New HavenCT06520 United States Integrated Graduate Program in Physical and Engineering Biology Yale University New HavenCT06520 United States Graduate Program in Computational Biology and Bioinformatics Yale University New HavenCT06520 United States Department of Chemistry Yale University New HavenCT06520 United States Department of Physics Yale University New HavenCT06520 United States Department of Applied Physics Yale University New HavenCT06520 United States

Proteins naturally occur in crowded cellular environments and interact with other proteins, nucleic acids, and organelles. Since most previous experimental protein structure determination techniques require that proteins occur in idealized, non-physiological environments, the effects of realistic cellular environments on protein structure are largely unexplored. Recently, Förster resonance energy transfer (FRET) has been shown to be an effective experimental method for investigating protein structure in vivo. Inter-residue distances measured in vivo can be incorporated as restraints in molecular dynamics (MD) simulations to model protein structural dynamics in vivo. Since most FRET studies only obtain inter-residue separations for a small number of amino acid pairs, it is important to determine the minimum number of restraints in the MD simulations that are required to achieve a given root-mean-square deviation (RMSD) from the experimental structural ensemble. Further, what is the optimal method for selecting these inter-residue restraints? Here, we implement several methods for selecting the most important FRET pairs and determine the number of pairs Nr that are needed to induce conformational changes in proteins between two experimentally determined structures. We find that enforcing only a small fraction of restraints, Nr/N 0.08, where N is the number of amino acids, can induce the conformational changes. These results establish the efficacy of FRET-assisted MD simulations for atomic scale structural modeling of proteins in vivo. © 2024, CC BY.

关键词： Conformations

Scalable On-Chain Storage and Querying for Biomedical Certificates: A Blockchain Solution for Large Data Handling

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Ni, Eric Knight, Elizabeth Gerstein, Mark Program in Computational Biology and Bioinformatics Yale University 100 College Street New HavenCT06511 United States Department of Molecular Biophysics & Biochemistry Yale University 266 Whitney Avenue New HavenCT06511 United States Yale School of Medicine 333 Cedar Street New HavenCT06510 United States

Blockchain technology is gaining increased traction in the biomedical sector due to its ability to improve trust and reduce the risk of fraud and errors in the handling of health data. However, the large volume of biomedical datasets has slowed its adoption due to poor scalability. This challenge is especially relevant for applications that rely on blockchain’s strong immutability by storing data directly on-chain. Here, we demonstrate the potential of blockchain to create a secure and trustless environment for managing large on-chain records. Specifically, we detail an efficient, index-based approach for storing data on the Ethereum blockchain. We show that insertion and retrieval speeds remain nearly constant relative to database size, scaling linearly with the amount of data processed. Additionally, we achieve substantial efficiency gains through low-level assembly optimizations on the Ethereum Virtual Machine, underscoring the limitations of the Solidity compiler. Finally, we illustrate this approach through a practical case study, designing a smart contract for storing and querying training certificates on the Ethereum blockchain. Our solution achieves ~2x faster data insertion, ~500x faster retrieval, ~60% lower gas costs, and 50% lower storage usage compared to baseline methods. It won first place for track 1 of the 2022 iDASH secure genome analysis competition. We also demonstrate that this solution readily adapts to other data types, enabling efficient on-chain storage and retrieval of text, RNA-seq, or biomedical image data. © 2024, The Authors. All rights reserved.

关键词： Chains

Core packing of well-defined x-ray and NMR structures is the same

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Grigas, Alex T. Liu, Zhuoyi Regan, Lynne O’Hern, Corey S. Graduate Program in Computational Biology and Bioinformatics Yale University New HavenCT06520 United States Integrated Graduate Program in Physical and Engineering Biology Yale University New HavenCT06520 United States Department of Mechanical Engineering and Materials Science Yale University New HavenCT06520 United States Institute of Quantitative Biology Biochemistry and Biotechnology Centre for Synthetic and Systems Biology School of Biological Sciences University of Edinburgh United Kingdom Department of Physics Yale University New HavenCT06520 United States Department of Applied Physics Yale University New HavenCT06520 United States

Numerous studies have investigated the differences and similarities between protein structures determined by solution NMR spectroscopy and those determined by x-ray crystallography. A fundamental question is whether any observed differences are due to differing methodologies, or to differences in the behavior of proteins in solution versus in the crystalline state. Here, we compare the properties of the hydrophobic cores of high-resolution protein crystal structures and those in NMR structures, determined using increasing numbers and types of restraints. Prior studies have reported that many NMR structures have denser cores compared to those of high-resolution x-ray crystal structures. Our current work investigates this result in more detail, and finds that these NMR structures tend to violate basic features of protein stereochemistry, such as small non-bonded atomic overlaps and few Ramachandran and side chain dihedral angle outliers. We find that NMR structures solved with more restraints, and which do not significantly violate stereochemistry, have hydrophobic cores that have a similar size and packing fraction as their counterparts determined by x-ray crystallography at high-resolution. These results lead us to conclude that, at least regarding the core packing properties, high-quality structures determined by NMR and x-ray crystallography are the same, and the differences reported earlier are most likely a consequence of methodology, rather than fundamental differences between the protein in the two different environments. Significance: Dense packing of hydrophobic residues is key to protein structure and stability. Previously, it has been noted that structures solved by NMR spectroscopy have denser cores than x-ray crystal structures. Here, we calculate the core size and packing fraction of NMR structures with experimental restraints in the PDB. Their cores are typically smaller, but denser. However, NMR structures with accurate stereochemistry possess core pa

关键词： X ray crystallography

Local and global measures of the shear moduli of jammed disk packings

学校读者我要写书评

暂无评论

Physical Review E 2023年第5期107卷 054903-054903页

作者： Shiyun Zhang Weiwei Jin Dong Wang Ding Xu Jerry Zhang Mark D. Shattuck Corey S. O'Hern Department of Physics University of Science and Technology of China Hefei Anhui 230026 China Department of Mechanical Engineering and Materials Science Yale University New Haven Connecticut 06520 USA Benjamin Levich Institute and Physics Department The City College of New York New York New York 10031 USA Department of Physics Yale University New Haven Connecticut 06520 USA Department of Applied Physics Yale University New Haven Connecticut 06520 USA Graduate Program in Computational Biology and Bioinformatics Yale University New Haven Connecticut 06520 USA

Strain-controlled isotropic compression gives rise to jammed packings of repulsive, frictionless disks with either positive or negative global shear moduli. We carry out computational studies to understand the contributions of the negative shear moduli to the mechanical response of jammed disk packings. We first decompose the ensemble-averaged, global shear modulus as 〈G〉=(1−F−)〈G+〉+F−〈G−〉, where F− is the fraction of jammed packings with negative shear moduli and 〈G+〉 and 〈G−〉 are the average values from packings with positive and negative moduli, respectively. We show that 〈G+〉 and 〈|G−|〉 obey different power-law scaling relations above and below pN2∼1. For pN2>1, both 〈G+〉N and 〈|G−|〉N∼(pN2)β, where β∼0.5 for repulsive linear spring interactions. Despite this, 〈G〉N∼(pN2)β′ with β′≳0.5 due to the contributions from packings with negative shear moduli. We show further that the probability distribution of global shear moduli P(G) collapses at fixed pN2 and different values of p and N. We calculate analytically that P(G) is a Γ distribution in the pN2≪1 limit. As pN2 increases, the skewness of P(G) decreases and P(G) becomes a skew-normal distribution with negative skewness in the pN2≫1 limit. We also partition jammed disk packings into subsystems using Delaunay triangulation of the disk centers to calculate local shear moduli. We show that the local shear moduli defined from groups of adjacent triangles can be negative even when G>0. The spatial correlation function of local shear moduli C(r⃗) displays weak correlations for pnsub2<10−2, where nsub is the number of particles within each subsystem. However, C(r⃗) begins to develop long-ranged spatial correlations with fourfold angular symmetry for pnsub2≳10−2.

关键词： Jamming Packing & jamming problems Granular materials

Scalable privacy-preserving cancer type prediction with homomorphic encryption

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sarkar, Esha Chielle, Eduardo Gursoy, Gamze Chen, Leo Gerstein, Mark Maniatakos, Michail Tandon School of Engineering New York University Brooklyn United States Department of Electrical and Computer Engineering New York University Abu Dhabi Abu Dhabi United Arab Emirates Program in Computational Biology and Bioinformatics Yale University New Haven United States Department of Computer Science Yale University New Haven United States

Machine Learning (ML) alleviates the challenges of high-dimensional data analysis and improves decision making in critical applications like healthcare. Effective cancer/tumor classification from high-dimensional genetic mutation data can be useful for cancer diagnosis and treatment, if the distinguishable patterns between cancer/tumor types are identified. At the same time, analysis of high-dimensional data is computationally expensive and is often outsourced to cloud services. Privacy concerns in outsourced ML, especially in the field of genetics, motivate the use of encrypted computation, like Homomorphic Encryption (HE). But restrictive overheads of encrypted computation deter its usage. In this work, we explore the challenges of privacy preserving cancer detection using a real-world dataset consisting of more than 2 million genetic information for several cancer types. Since the data is inherently high-dimensional, we explore smaller ML models for cancer prediction to enable fast inference in the privacy preserving domain. We develop a solution for privacy preserving cancer inference which first leverages the domain knowledge on somatic mutations to efficiently encode genetic mutations and then uses statistical tests for feature selection. Our logistic regression model, built using our novel encoding scheme, achieves 0.98 micro-average area under curve with 13% higher test accuracy than similar studies. We exhaustively test our model’s predictive capabilities by analyzing the genes used by the model. Furthermore, we propose a fast matrix multiplication algorithm that can efficiently handle high-dimensional data. Experimental results show that, even with 40,000 features, our proposed matrix multiplication algorithm can speed up concurrent inference of multiple individuals by approximately 10x and inference of a single individual by approximately 550x, in comparison to standard matrix multiplication. © 2022, CC BY.

关键词： Clustering algorithms

DIFFUSION CURVATURE FOR ESTIMATING LOCAL CURVATURE IN HIGH DIMENSIONAL DATA

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Bhaskar, Dhananjay MacDonald, Kincaid Fasina, Oluwadamilola Thomas, Dawson Rieck, Bastian Adelstein, Ian Krishnaswamy, Smita Department of Genetics Yale School of Medicine New HavenCT United States Department of Mathematics Yale University New HavenCT United States Program for Applied Mathematics Yale University New HavenCT United States Department of Physics Yale University New HavenCT United States Institute of AI for Health Helmholtz Pioneer Campus Munich Germany Department of Computer Science Yale University New HavenCT United States Program for Computational Biology and Bioinformatics Yale University New HavenCT United States

We introduce a new intrinsic measure of local curvature on point-cloud data called diffusion curvature. Our measure uses the framework of diffusion maps, including the data diffusion operator, to structure point cloud data and define local curvature based on the laziness of a random walk starting at a point or region of the data. We show that this laziness directly relates to volume comparison results from Riemannian geometry. We then extend this scalar curvature notion to an entire quadratic form using neural network estimations based on the diffusion map of point-cloud data. We show applications of both estimations on toy data, single-cell data and on estimating local Hessian matrices of neural network loss landscapes. © 2022, CC BY.

关键词： Geometry

Pseudo-perplexity in One Fell Swoop for Protein Fitness Estimation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kantroo, Pranav Wagner, Günter P. Machta, Benjamin B. Computational Biology and Bioinformatics Program Yale University New HavenCT06520 United States Emeritus Department of Ecology and Evolutionary Biology Yale University New HavenCT06520 United States Department of Evolutionary Biology University of Vienna Djerassi Platz 1 ViennaA-1030 Austria Hagler Institute for Advanced Studies Texas A&M College StationTX77843 United States Department of Physics Yale University New HavenCT06520 United States Quantitative Biology Institute Yale University New HavenCT06520 United States

Protein language models trained on the masked language modeling objective learn to predict the identity of hidden amino acid residues within a sequence using the remaining observable sequence as context. They do so by embedding the residues into a high dimensional space that encapsulates the relevant contextual cues. These embedding vectors serve as an informative context-sensitive representation that not only aids with the defined training objective, but can also be used for other tasks by downstream models. We propose a scheme to use the embeddings of an unmasked sequence to estimate the corresponding masked probability vectors for all the positions in a single forward pass through the language model. This One Fell Swoop (OFS) approach allows us to efficiently estimate the pseudo-perplexity of the sequence, a measure of the model's uncertainty in its predictions, that can also serve as a fitness estimate. We find that ESM2 OFS pseudo-perplexity performs nearly as well as the true pseudo-perplexity at fitness estimation, and more notably it defines a new state of the art on the ProteinGym Indels benchmark. The strong performance of the fitness measure prompted us to investigate if it could be used to detect the elevated stability reported in reconstructed ancestral sequences. We find that this measure ranks ancestral reconstructions as more fit than extant sequences. Finally, we show that the computational efficiency of the technique allows for the use of Monte Carlo methods that can rapidly explore functional sequence space. © 2024, CC BY.

关键词： Embeddings

High fitness paths can connect proteins with low sequence overlap

学校读者我要写书评

暂无评论

arXiv 2024年

The structure and function of a protein are determined by its amino acid sequence. While random mutations change a protein’s sequence, evolutionary forces shape its structural fold and biological activity. Studies have shown that neutral networks can connect a local region of sequence space by single residue mutations that preserve viability. However, the larger-scale connectedness of protein morphospace remains poorly understood. Recent advances in artificial intelligence have enabled us to computationally predict a protein’s structure and quantify its functional plausibility. Here we build on these tools to develop an algorithm that generates viable paths between distantly related extant protein pairs. The intermediate sequences in these paths differ by single residue changes over subsequent steps – substitutions, insertions and deletions are admissible moves. Their fitness is evaluated using the protein language model ESM2, and maintained as high as possible subject to the constraints of the traversal. We document the qualitative variation across paths generated between progressively divergent protein pairs, some of which do not even acquire the same structural fold. The ease of interpolating between two sequences could be used as a proxy for the likelihood of homology between them. © 2024, CC BY.

关键词：

Void distributions reveal structural link between jammed packings and protein cores

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Treado, John D. Mei, Zhe Regan, Lynne O'Hern, Corey S. Department of Mechanical Engineering & Materials Science Yale University New HavenCT06520 United States Integrated Graduate Program in Physical & Engineering Biology Yale University New HavenCT06520 United States Department of Chemistry Yale University New HavenCT06520 United States Department of Molecular Biophysics & Biochemistry Yale University New HavenCT06520 United States Department of Physics Yale University New HavenCT06520 United States Department of Applied Physics Yale University New HavenCT06520 United States Program in Computational Biology and Bioinformatics Yale University New HavenCT06520 United States

Dense packing of hydrophobic residues in the cores of globular proteins determines their stability. Recently, we have shown that protein cores possess packing fraction φ ≈ 0.56, which is the same as dense, random packing of amino acid-shaped particles. In this article, we compare the structural properties of protein cores and jammed packings of amino acid-shaped particles in much greater depth by measuring their local and connected void regions. We find that the distributions of surface Voronoi cell volumes and local porosities obey similar statistics in both systems. We also measure the probability that accessible, connected void regions percolate as a function of the size of a spherical probe particle and show that both systems possess the same critical probe size. By measuring the critical exponent τ that characterizes the size distribution of connected void clusters at the onset of percolation, we show that void percolation in packings of amino acid-shaped particles and protein cores belong to the same universality class, which is different from that for void percolation in jammed sphere packings. We propose that the connected void regions of proteins are a defining feature of proteins and can be used to differentiate experimentally observed proteins from decoy structures that are generated using computational protein design software. This work emphasizes that jammed packings of amino acid-shaped particles can serve as structural and mechanical analogs of protein cores, and could therefore be useful in modeling the response of protein cores to cavity-expanding and -reducing mutations. Copyright © 2018, The Authors. All rights reserved.

关键词： Amino acids