MOTIVATION: Molecular dynamics (MD) simulations provide critical insights into biomolecular processes but they generate complex high-dimensional data that are often difficult to interpret directly. Dimensionality reduction methods like principal component analysis, time-lagged independent component analysis, and self-organizing maps (SOMs) have helped in extracting essential information on functional dynamics. However, there is a growing need for a user-friendly and flexible framework for SOM-based analyses of MD simulations. Such a framework should offer adaptable workflows, customizable options, and direct integration with a widely adopted analysis software. RESULTS: We designed and developed SOMMD, an R package to streamline MD analysis workflows. SOMMD facilitates the interpretation of atomistic trajectories through SOMs, providing tools for each stage of the workflow, from importing a wide range of MD trajectories data types to generating enhanced visualizations. The package also includes three example projects that demonstrate how SOM can be applied in real-world scenarios, including cluster analysis, pathways mapping and transition networks reconstruction. AVAILABILITY AND IMPLEMENTATION: SOMMD is available on CRAN (https://CRAN.R-project.org/package=SOMMD) and on GitHub (https://github.com/alepandini/SOMMD).

MOTIVATION: Molecular Dynamics (MD) simulations are essential for investigating protein dynamics and function. Although significant advances have been made in integrating simulation techniques and machine learning, there are still challenges in selecting the most suitable data representation for learning. Graph embedding is a powerful computational method that automatically learns low-dimensional representations of nodes in a graph while preserving graph topology and node properties, thereby bridging graph structures and machine learning methods. Graph embeddings hold great potential for efficiently representing MD simulation data and studying protein dynamics. RESULTS: We present MDGraphEmb, a Python library built on MDAnalysis, specifically designed to convert protein MD simulation trajectories into graph-based representations and corresponding graph embeddings. This transformation enables the compression of high-dimensional, noisy trajectories from protein simulations into tabular formats suitable for machine learning. MDGraphEmb provides a framework that supports a range of graph embedding techniques and machine learning models, enabling the creation of workflows to analyse protein dynamics and identify important protein conformations. Graph embedding effectively captures and compresses structural information from protein MD simulation data, making it applicable to diverse downstream machine-learning classification tasks. We present an application for encoding and detecting important protein conformations from molecular dynamics simulations to classify functional states, using adenylate kinase (ADK) as the main case study. To assess the generalizability of the approach, two additional systems, Plantaricin E (PlnE) and HIV-1 protease are included as supplementary validation examples. A performance comparison of different graph embedding methods combined with machine learning models is also provided. AVAILABILITY AND IMPLEMENTATION: MDGraphEMB GitHub Repository: https://github.com/FerdoosHN/MDGraphEMB.

MOTIVATION: Computational methods to detect correlated amino acid positions in proteins have become a valuable tool to predict intra- and inter-residue protein contacts, protein structures, and effects of mutation on protein stability and function. While there are many tools and webservers to compute coevolution scoring matrices, there is no central repository of alignments and coevolution matrices for large-scale studies and pattern detection leveraging on biological and structural annotations already available in UniProt. RESULTS: We present a Python library, PyCoM, which enables users to query and analyze coevolution matrices and sequence alignments of 457 622 proteins, selected from UniProtKB/Swiss-Prot database (length ≤ 500 residues), from a precompiled coevolution matrix database (PyCoMdb). PyCoM facilitates the development of statistical analyses of residue coevolution patterns using filters on biological and structural annotations from UniProtKB/Swiss-Prot, with simple access to PyCoMdb for both novice and advanced users, supporting Jupyter Notebooks, Python scripts, and a web API access. The resource is open source and will help in generating data-driven computational models and methods to study and understand protein structures, stability, function, and design. AVAILABILITY AND IMPLEMENTATION: PyCoM code is freely available from https://github.com/scdantu/pycom and PyCoMdb and the Jupyter Notebook tutorials are freely available from https://pycom.brunel.ac.uk.

MOTIVATION: Molecular dynamics (MD) simulations have become routine tools for the study of protein dynamics and function. Thanks to faster GPU-based algorithms, atomistic and coarse-grained simulations are being used to explore biological functions over the microsecond timescale, yielding terabytes of data spanning multiple trajectories, thereby extracting relevant protein conformations without losing important information is often challenging. RESULTS: We present MDSubSampler, a Python library and toolkit for a posteriori subsampling of data from multiple trajectories. This toolkit provides access to uniform, random, stratified, weighted sampling, and bootstrapping sampling methods. Sampling can be performed under the constraint of preserving the original distribution of relevant geometrical properties. Possible applications include simulations post-processing, noise reduction, and structures selection for ensemble docking. AVAILABILITY AND IMPLEMENTATION: MDSubSampler is freely available at https://github.com/alepandini/MDSubSampler, along with guidance on installation and tutorials on how it can be used.

The calcium calmodulin-dependent protein kinase II (CaMKII) is a dodecameric holoenzyme important for encoding memory. Its activation, triggered by binding of calcium-calmodulin, persists autonomously after calmodulin dissociation. One (receiver) kinase captures and subsequently phosphorylates the regulatory domain peptide of a donor kinase forming a chained dimer as the first stage of autonomous activation. Protein dynamics simulations examined the conformational changes triggered by dimer formation and phosphorylation, aimed to provide a molecular rationale for human mutations that result in learning disabilities. Ensembles generated from X-ray crystal structures were characterized by network centrality and community analysis. Mutual information related collective motions to local fragment dynamics encoded with a structural alphabet. Implicit solvent tCONCOORD conformational ensembles revealed the dynamic architecture of inactive kinase domains was co-opted in the activated dimer but the network hub shifted from the nucleotide binding cleft to the captured peptide. Explicit solvent molecular dynamics (MD) showed nucleotide and substrate binding determinants formed coupled nodes in long-range signal relays between regulatory peptides in the dimer. Strain in the extended captured peptide was balanced by reduced flexibility of the receiver kinase C-lobe core. The relays were organized around a hydrophobic patch between the captured peptide and a key binding helix. The human mutations aligned along the relays. Thus, these mutations could disrupt the allosteric network alternatively, or in addition, to altered binding affinities. Non-binding protein sectors distant from the binding sites mediated the allosteric signalling; providing possible targets for inhibitor design. Phosphorylation of the peptide modulated the dielectric of its binding pocket to strengthen the patch, non-binding sectors, domain interface and temporal correlations between parallel relays. These results provide the molecular details underlying the reported positive kinase cooperativity to enrich the discussion on how autonomous activation by phosphorylation leads to long-term behavioural effects.

Motivation: A deleterious amino acid change in a protein can be compensated by a second-site rescue mutation. These compensatory mechanisms can be mimicked by drugs. In particular, the location of rescue mutations can be used to identify protein regions that can be targeted by small molecules to reactivate a damaged mutant. Results: We present the first general computational method to detect rescue sites. By mimicking the effect of mutations through the application of forces, the double force scanning (DFS) method identifies the second-site residues that make the protein structure most resilient to the effect of pathogenic mutations. We tested DFS predictions against two datasets containing experimentally validated and putative evolutionary-related rescue sites. A remarkably good agreement was found between predictions and experimental data. Indeed, almost half of the rescue sites in p53 was correctly predicted by DFS, with 65% of remaining sites in contact with DFS predictions. Similar results were found for other proteins in the evolutionary dataset. Availability and implementation: The DFS code is available under GPL at https://fornililab.github.io/dfs/. Supplementary information: Supplementary data are available at Bioinformatics online.

Hypoxia inducible factors (HIFs) are transcription factors belonging to the basic helix-loop-helix PER-ARNT-SIM (bHLH-PAS) protein family with a role in sensing oxygen levels in the cell. Under hypoxia, the HIF-α degradation pathway is blocked and dimerization with the aryl hydrocarbon receptor nuclear translocator (ARNT) makes HIF-α transcriptionally active. Due to the common hypoxic environment of tumors, inhibition of this mechanism by destabilization of HIF-α:ARNT dimerization has been proposed as a promising therapeutic strategy. Following the discovery of a druggable cavity within the PAS-B domain of HIF-2α, research efforts have been directed to identify artificial ligands that can impair heterodimerization. Although the crystallographic structures of the HIF-2α:ARNT complex have elucidated the dimer architecture and the 0X3-inhibitor placement within the HIF-2α PAS-B, unveiling the inhibition mechanism requires investigation of how ligand-induced perturbations could dynamically propagate through the structure and affect dimerization. To this end, we compared evolutionary features, intrinsic dynamics and energetic properties of the dimerization interfaces of HIF-2α:ARNT in both the apo and holo forms. Residue conservation analysis highlighted inter-domain connecting elements that have a role in dimerization. Analysis of domain contributions to the dimerization energy demonstrated the importance of bHLH and PAS-A of both partners and of HIF-2α PAS-B domain in dimer stabilization. Among quaternary structure oscillations revealed by Molecular Dynamics simulations, the hinge-bending motion of the ARNT PAS-B domain around the flexible PAS-A/PAS-B linker supports a general model for ARNT dimerization in different heterodimers. Comparison of the HIF-2α:ARNT dynamics in the apo and 0X3-bound forms indicated a model of inhibition where the HIF-2α-PAS-B interfaces are destabilised as a result of water-bridged ligand-protein interactions and these local effects allosterically propagate to perturb the correlated motions of the domains and inter-domain communication. These findings will guide the design of improved inhibitors to contrast cell survival in tumor masses.

MOTIVATION: GSATools is a free software package to analyze conformational ensembles and to detect functional motions in proteins by means of a structural alphabet. The software integrates with the widely used GROMACS simulation package and can generate a range of graphical outputs. Three applications can be supported: (i) investigation of the conformational variability of local structures; (ii) detection of allosteric communication; and (iii) identification of local regions that are critical for global functional motions. These analyses provide insights into the dynamics of proteins and allow for targeted design of functional mutants in theoretical and experimental studies. AVAILABILITY: The C source code of the GSATools, along with a set of pre-compiled binaries, is freely available under GNU General Public License from http://mathbio.nimr.mrc.ac.uk/wiki/GSATools.

BACKGROUND: Molecular dynamics (MD) simulations are powerful tools to investigate the conformational dynamics of proteins that is often a critical element of their function. Identification of functionally relevant conformations is generally done clustering the large ensemble of structures that are generated. Recently, Self-Organising Maps (SOMs) were reported performing more accurately and providing more consistent results than traditional clustering algorithms in various data mining problems. We present a novel strategy to analyse and compare conformational ensembles of protein domains using a two-level approach that combines SOMs and hierarchical clustering. RESULTS: The conformational dynamics of the α-spectrin SH3 protein domain and six single mutants were analysed by MD simulations. The Cα's Cartesian coordinates of conformations sampled in the essential space were used as input data vectors for SOM training, then complete linkage clustering was performed on the SOM prototype vectors. A specific protocol to optimize a SOM for structural ensembles was proposed: the optimal SOM was selected by means of a Taguchi experimental design plan applied to different data sets, and the optimal sampling rate of the MD trajectory was selected. The proposed two-level approach was applied to single trajectories of the SH3 domain independently as well as to groups of them at the same time. The results demonstrated the potential of this approach in the analysis of large ensembles of molecular structures: the possibility of producing a topological mapping of the conformational space in a simple 2D visualisation, as well as of effectively highlighting differences in the conformational dynamics directly related to biological functions. CONCLUSIONS: The use of a two-level approach combining SOMs and hierarchical clustering for conformational analysis of structural ensembles of proteins was proposed. It can easily be extended to other study cases and to conformational ensembles from other sources.

BACKGROUND: The hierarchical and partially redundant nature of protein structures justifies the definition of frequently occurring conformations of short fragments as 'states'. Collections of selected representatives for these states define Structural Alphabets, describing the most typical local conformations within protein structures. These alphabets form a bridge between the string-oriented methods of sequence analysis and the coordinate-oriented methods of protein structure analysis. RESULTS: A Structural Alphabet has been derived by clustering all four-residue fragments of a high-resolution subset of the protein data bank and extracting the high-density states as representative conformational states. Each fragment is uniquely defined by a set of three independent angles corresponding to its degrees of freedom, capturing in simple and intuitive terms the properties of the conformational space. The fragments of the Structural Alphabet are equivalent to the conformational attractors and therefore yield a most informative encoding of proteins. Proteins can be reconstructed within the experimental uncertainty in structure determination and ensembles of structures can be encoded with accuracy and robustness. CONCLUSIONS: The density-based Structural Alphabet provides a novel tool to describe local conformations and it is specifically suitable for application in studies of protein dynamics.

MOTIVATION: The size of current protein databases is a challenge for many Bioinformatics applications, both in terms of processing speed and information redundancy. It may be therefore desirable to efficiently reduce the database of interest to a maximally representative subset. RESULTS: The MinSet method employs a combination of a Suffix Tree and a Genetic Algorithm for the generation, selection and assessment of database subsets. The approach is generally applicable to any type of string-encoded data, allowing for a drastic reduction of the database size whilst retaining most of the information contained in the original set. We demonstrate the performance of the method on a database of protein domain structures encoded as strings. We used the SCOP40 domain database by translating protein structures into character strings by means of a structural alphabet and by extracting optimized subsets according to an entropy score that is based on a constant-length fragment dictionary. Therefore, optimized subsets are maximally representative for the distribution and range of local structures. Subsets containing only 10% of the SCOP structure classes show a coverage of >90% for fragments of length 1-4. AVAILABILITY: http://mathbio.nimr.mrc.ac.uk/~jkleinj/MinSet. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.