Global connectivity of hub residues in Oncoprotein structures encodes genetic factors dictating personalized drug response to targeted Cancer therapy

Analysis of protein-protein interface with incorporating low-frequency molecular interactions in molecular dynamics simulation

Protein-protein interactions are vital for various biological processes such as immune reaction, signal transduction, and viral infection. Molecular Dynamics (MD) simulation is a powerful tool for analyzing non-covalent interactions between two protein molecules. In general, MD simulation studies on the protein-protein interface have focused on the analysis of major and frequent molecular interactions. In this study, we demonstrate that minor interactions with low-frequency need to be incorporated to analyze the molecular interactions in the protein-protein interface more efficiently using the complex of SARS-CoV2-RBD and ACE2 receptor as a model system. It was observed that the dominance of interactions in the MD-simulated structures didn't directly correlate with the interactions in the experimentally determined structure. The interactions from the experimentally determined structure could be reproduced better in the ensemble of MD simulated structures by including the less frequent interactions compared to the norm of choosing only highly frequent interactions. Residue Interaction Networks (RINs) analysis also showed that the critical residues in the protein-protein interface could be more efficiently identified by incorporating low-frequency interactions in MD simulation. It is expected that the approach proposed in this study can be a new way of studying protein-protein interaction through MD simulation.

Integration of network models and evolutionary analysis into high-throughput modeling of protein dynamics and allosteric regulation: theory, tools and applications

Proteins are dynamical entities that undergo a plethora of conformational changes, accomplishing their biological functions. Molecular dynamics simulation and normal mode analysis methods have become the gold standard for studying protein dynamics, analyzing molecular mechanism and allosteric regulation of biological systems. The enormous amount of the ensemble-based experimental and computational data on protein structure and dynamics has presented a major challenge for the high-throughput modeling of protein regulation and molecular mechanisms. In parallel, bioinformatics and systems biology approaches including genomic analysis, coevolution and network-based modeling have provided an array of powerful tools that complemented and enriched biophysical insights by enabling high-throughput analysis of biological data and dissection of global molecular signatures underlying mechanisms of protein function and interactions in the cellular environment. These developments have provided a powerful interdisciplinary framework for quantifying the relationships between protein dynamics and allosteric regulation, allowing for high-throughput modeling and engineering of molecular mechanisms. Here, we review fundamental advances in protein dynamics, network theory and coevolutionary analysis that have provided foundation for rapidly growing computational tools for modeling of allosteric regulation. We discuss recent developments in these interdisciplinary areas bridging computational biophysics and network biology, focusing on promising applications in allosteric regulations, including the investigation of allosteric communication pathways, protein–DNA/RNA interactions and disease mutations in genomic medicine. We conclude by formulating and discussing future directions and potential challenges facing quantitative computational investigations of allosteric regulatory mechanisms in protein systems.

Identifying anti-cancer drug response related genes using an integrative analysis of transcriptomic and genomic variations with cell line-based drug perturbations

Background

Clinical responses to anti-cancer therapies often only benefit a defined subset of patients. Predicting the best treatment strategy hinges on our ability to effectively translate genomic data into actionable information on drug responses.

Results

To achieve this goal, we compiled a comprehensive collection of baseline cancer genome data and drug response information derived from a large panel of cancer cell lines. This data set was applied to identify the signature genes relevant to drug sensitivity and their resistance by integrating CNVs and the gene expression of cell lines with in vitro drug responses. We presented an efficient in-silico pipeline for integrating heterogeneous cell line data sources with the simultaneous modeling of drug response values across all the drugs and cell lines. Potential signature genes correlated with drug response (sensitive or resistant) in different cancer types were identified. Using signature genes, our collaborative filtering-based drug response prediction model outperformed the 44 algorithms submitted to the DREAM competition on breast cancer cells. The functions of the identified drug response related signature genes were carefully analyzed at the pathway level and the synthetic lethality level. Furthermore, we validated these signature genes by applying them to the classification of the different subtypes of the TCGA tumor samples, and further uncovered their in vivo implications using clinical patient data.

Conclusions

Our work may have promise in translating genomic data into customized marker genes relevant to the response of specific drugs for a specific cancer type of individual patients.

Approximating frustration scores in complex networks via perturbed Laplacian spectra

Systems of many interacting components, as found in physics, biology, infrastructure, and the social sciences, are often modeled by simple networks of nodes and edges. The real-world systems frequently confront outside intervention or internal damage whose impact must be predicted or minimized, and such perturbations are then mimicked in the models by altering nodes or edges. This leads to the broad issue of how to best quantify changes in a model network after some type of perturbation. In the case of node removal there are many centrality metrics which associate a scalar quantity with the removed node, but it can be difficult to associate the quantities with some intuitive aspect of physical behavior in the network. This presents a serious hurdle to the application of network theory: real-world utility networks are rarely altered according to theoretic principles unless the kinetic impact on the network's users are fully appreciated beforehand. In pursuit of a kinetically interpretable centrality score, we discuss the f-score, or frustration score. Each f-score quantifies whether a selected node accelerates or inhibits global mean first passage times to a second, independently selected target node. We show that this is a natural way of revealing the dynamical importance of a node in some networks. After discussing merits of the f-score metric, we combine spectral and Laplacian matrix theory in order to quickly approximate the exact f-score values, which can otherwise be expensive to compute. Following tests on both synthetic and real medium-sized networks, we report f-score runtime improvements over exact brute force approaches in the range of 0 to 400% with low error (<3%).