A new method for protein domain recognition

Assignment of structural domains in proteins using diffusion kernels on graphs

Though proposing algorithmic approaches for protein domain decomposition has been of high interest, the inherent ambiguity to the problem makes it still an active area of research. Besides, accurate automated methods are in high demand as the number of solved structures for complex proteins is on the rise. While majority of the previous efforts for decomposition of 3D structures are centered on the developing clustering algorithms, employing enhanced measures of proximity between the amino acids has remained rather uncharted. If there exists a kernel function that in its reproducing kernel Hilbert space, structural domains of proteins become well separated, then protein structures can be parsed into domains without the need to use a complex clustering algorithm. Inspired by this idea, we developed a protein domain decomposition method based on diffusion kernels on protein graphs. We examined all combinations of four graph node kernels and two clustering algorithms to investigate their capability to decompose protein structures. The proposed method is tested on five of the most commonly used benchmark datasets for protein domain assignment plus a comprehensive non-redundant dataset. The results show a competitive performance of the method utilizing one of the diffusion kernels compared to four of the best automatic methods. Our method is also able to offer alternative partitionings for the same structure which is in line with the subjective definition of protein domain. With a competitive accuracy and balanced performance for the simple and complex structures despite relying on a relatively naive criterion to choose optimal decomposition, the proposed method revealed that diffusion kernels on graphs in particular, and kernel functions in general are promising measures to facilitate parsing proteins into domains and performing different structural analysis on proteins. The size and interconnectedness of the protein graphs make them promising targets for diffusion kernels as measures of affinity between amino acids. The versatility of our method allows the implementation of future kernels with higher performance. The source code of the proposed method is accessible at https://github.com/taherimo/kludo . Also, the proposed method is available as a web application from https://cbph.ir/tools/kludo .

Optimal identification of semi-rigid domains in macromolecules from molecular dynamics simulation

Biological function relies on the fact that biomolecules can switch between different conformations and aggregation states. Such transitions involve a rearrangement of parts of the biomolecules involved that act as dynamic domains. The reliable identification of such domains is thus a key problem in biophysics. In this work we present a method to identify semi-rigid domains based on dynamical data that can be obtained from molecular dynamics simulations or experiments. To this end the average inter-atomic distance-deviations are computed. The resulting matrix is then clustered by a constrained quadratic optimization problem. The reliability and performance of the method are demonstrated for two artificial peptides. Furthermore we correlate the mechanical properties with biological malfunction in three variants of amyloidogenic transthyretin protein, where the method reveals that a pathological mutation destabilizes the natural dimer structure of the protein. Finally the method is used to identify functional domains of the GroEL-GroES chaperone, thus illustrating the efficiency of the method for large biomolecular machines.

Elucidating protein secondary structures using alpha-carbon recurrence quantifications

Secondary structures of proteins were studied by recurrence quantification analysis (RQA). High-resolution, 3-dimensional coordinates of alpha-carbon atoms comprising a set of 68 proteins were downloaded from the Protein Data Bank. By fine-tuning four recurrence parameters (radius, line, residue, separation), it was possible to establish excellent agreement between percent contribution of alpha-helix and beta-sheet structures determined independently by RQA and that of the DSSP algorithm (Define Secondary Structure of Proteins). These results indicate that there is an equivalency between these two techniques, which are based upon totally different pattern recognition strategies. RQA enhances qualitative contact maps by quantifying the arrangements of recurrent points of alpha carbons close in 3-dimensional space. For example, the radius was systematically increased, moving the analysis beyond local alpha-carbon neighborhoods in order to capture super-secondary and tertiary structures. However, differences between proteins could only be detected within distances up to about 6-11 A, but not higher. This result underscores the complexity of alpha-carbon spacing when super-secondary structures appear at larger distances. Finally, RQA-defined secondary structures were found to be robust against random displacement of alpha carbons upwards of 1 A. This finding has potential import for the dynamic functions of proteins in motion.