Searching for Structure: Characterizing the Protein Conformational Landscape with Clustering-Based Algorithms.

The identification and characterization of the main conformations from a protein population are a challenging and inherently high-dimensional problem. Here, we evaluate the performance of the Secondary sTructural Ensembles with machine LeArning (StELa) double-clustering method, which clusters protein structures based on the relationship between the φ and ψ dihedral angles in a protein backbone and the secondary structure of the protein, thus focusing on the local properties of protein structures. The classification of states as vectors composed of the clusters' indices arising naturally from the Ramachandran plot is followed by the hierarchical clustering of the vectors to allow for the identification of the main features of the corresponding free energy landscape (FEL). We compare the performance of StELa with the established root-mean-squared-deviation (RMSD)-based clustering algorithm, which focuses on global properties of protein structures and with Combinatorial Averaged Transient Structure (CATS), the combinatorial averaged transient structure clustering method based on distributions of the φ and ψ dihedral angle coordinates. Using ensembles of conformations from molecular dynamics simulations of intrinsically disordered proteins (IDPs) of various lengths (tau protein fragments) or short fragments from a globular protein, we show that StELa is the clustering method that identifies many of the minima and relevant energy states around the minima from the corresponding FELs. In contrast, the RMSD-based algorithm yields a large number of clusters that usually cover most of the FEL, thus being unable to distinguish between states, while CATS does not sample well the FELs for long IDPs and fragments from globular proteins.

The quaternary question: Determining allostery in spastin through dynamics classification learning and bioinformatics.

The nanomachine from the ATPases associated with various cellular activities superfamily, called spastin, severs microtubules during cellular processes. To characterize the functionally important allostery in spastin, we employed methods from evolutionary information, to graph-based networks, to machine learning applied to atomistic molecular dynamics simulations of spastin in its monomeric and the functional hexameric forms, in the presence or absence of ligands. Feature selection, using machine learning approaches, for transitions between spastin states recognizes all the regions that have been proposed as allosteric or functional in the literature. The analysis of the composition of the Markov State Model macrostates in the spastin monomer, and the analysis of the direction of change in the top machine learning features for the transitions, indicate that the monomer favors the binding of ATP, which primes the regions involved in the formation of the inter-protomer interfaces for binding to other protomer(s). Allosteric path analysis of graph networks, built based on the cross-correlations between residues in simulations, shows that perturbations to a hub specific for the pre-hydrolysis hexamer propagate throughout the structure by passing through two obligatory regions: the ATP binding pocket, and pore loop 3, which connects the substrate binding site to the ATP binding site. Our findings support a model where the changes in the terminal protomers due to the binding of ligands play an active role in the force generation in spastin. The secondary structures in spastin, which are found to be highly degenerative within the network paths, are also critical for feature transitions of the classification models, which can guide the design of allosteric effectors to enhance or block allosteric signaling.