CRAFT: a web-integrated cavity prediction tool based on flow transfer algorithm

Numerous computational methods, including evolutionary-based, energy-based, and geometrical-based methods, are utilized to identify cavities inside proteins. Cavity information aids protein function annotation, drug design, poly-pharmacology, and allosteric site investigation. This article introduces "flow transfer algorithm" for rapid and effective identification of diverse protein cavities through multidimensional cavity scan. Initially, it identifies delimiter and susceptible tetrahedra to establish boundary regions and provide seed tetrahedra. Seed tetrahedron faces are precisely scanned using the maximum circle radius to transfer seed flow to neighboring tetrahedra. Seed flow continues until terminated by boundaries or forbidden faces, where a face is forbidden if the estimated maximum circle radius is less or equal to the user-defined maximum circle radius. After a seed scanning, tetrahedra involved in the flow are clustered to locate the cavity. The CRAFT web interface integrates this algorithm for protein cavity identification with enhanced user control. It supports proteins with cofactors, hydrogens, and ligands and provides comprehensive features such as 3D visualization, cavity physicochemical properties, percentage contribution graphs, and highlighted residues for each cavity. CRAFT can be accessed through its web interface at http://pitools.niper.ac.in/CRAFT , complemented by the command version available at https://github.com/PGlab-NIPER/CRAFT/ .Scientific contribution: Flow transfer algorithm is a novel geometric approach for accurate and reliable prediction of diverse protein cavities. This algorithm employs a distinct concept involving maximum circle radius within the 3D Delaunay triangulation to address diverse van der Waals radii while existing methods overlook atom specific van der Waals radii or rely on complex weighted geometric techniques.

Beta-complex versus Alpha-complex: Similarities and Dissimilarities

The beta-complex is a construct derived from the Voronoi diagram of spherical balls of arbitrary radii and has proven a powerful capability for proximity reasoning among spherical balls in three-dimensional space. Important applications related to molecular shapes in structural/computational molecular biology have been correctly, efficiently, and conveniently solved in the unified framework of the beta-complex and the Voronoi diagram. The beta-complex is a generalization of the ordinary alpha-complex. However, there are similarities and dissimilarities between the two complexes and it is necessary to correctly understand these similarities and dissimilarities to choose the right complex to solve application problems at hand. This paper presents the similarities and dissimilarities between these constructs and illustrates the consequence of the dissimilarity in application problems from both theoretical and practical points of view using examples of atomic arrangements.

Detection of cave pockets in large molecules: Spaces into which internal probes can enter, but external probes from outside cannot

Geometric features of macromolecular shapes are important for binding with other molecules. Kawabata, T. and Go, N. (2007) defined a pocket as a space into which a small probe can enter, but a large probe cannot. In 2010, mathematical morphology (MM) was introduced to provide a more rigorous definition, and the program GHECOM was developed using the grid-based representation of molecules. This method was simple, but effective in finding the binding sites of small compounds on protein surfaces. Recently, many 3D structures of large macromolecules have been determined to contain large internal hollow spaces. Identification and size estimation of these spaces is important for characterizing their function and stability. Therefore, we employ the MM definition of pocket proposed by Manak, M. (2019)—a space into which an internal probe can enter, but an external probe cannot enter from outside of the macromolecules. This type of space is called a “cave pocket”, and is identified through molecular grid-representation. We define a “cavity” as a space into which a probe can enter, but cannot escape to the outside. Three types of spaces: cavity, pocket, and cave pocket were compared both theoretically and numerically. We proved that a cave pocket includes a pocket, and it is equal to a pocket if no cavity is found. We compared the three types of spaces for a variety of molecules with different-sized spherical probes; cave pockets were more sensitive than pockets for finding almost closed internal holes, allowing for more detailed representations of internal surfaces than cavities provide.

Geometric Detection Algorithms for Cavities on Protein Surfaces in Molecular Graphics: A Survey

Detecting and analyzing protein cavities provides significant information about active sites for biological processes (e.g., protein-protein or protein-ligand binding) in molecular graphics and modeling. Using the three-dimensional structure of a given protein (i.e., atom types and their locations in 3D) as retrieved from a PDB (Protein Data Bank) file, it is now computationally viable to determine a description of these cavities. Such cavities correspond to pockets, clefts, invaginations, voids, tunnels, channels, and grooves on the surface of a given protein. In this work, we survey the literature on protein cavity computation and classify algorithmic approaches into three categories: evolution-based, energy-based, and geometry-based. Our survey focuses on geometric algorithms, whose taxonomy is extended to include not only sphere-, grid-, and tessellation-based methods, but also surface-based, hybrid geometric, consensus, and time-varying methods. Finally, we detail those techniques that have been customized for GPU (Graphics Processing Unit) computing.

Computational protein design for given backbone: recent progresses in general method-related aspects

To achieve high success rate in protein design requires a reliable sequence design method to find amino acid sequences that stably fold into a desired backbone structure. This problem is addressed by computational protein design through the approach of energy minimization. Here we review recent method progresses related to improving the accuracy of this approach. First, the quality of the energy model is a key factor. Second, with structure sensitive energy functions, whether and how backbone flexibility is considered can have large effects on design accuracy, although usually only small adjustments of the backbone structure itself are involved. Third, the effective accuracy of design results can be boosted by post-processing a small number of designed sequences with complementary models that may not be efficient enough for full sequence optimization. Finally, computational method development will benefit greatly from increasingly efficient experimental approaches that can be applied to obtain extensive feedbacks.

CAVER: Algorithms for Analyzing Dynamics of Tunnels in Macromolecules

The biological function of a macromolecule often requires that a small molecule or ion is transported through its structure. The transport pathway often leads through void spaces in the structure. The properties of transport pathways change significantly in time; therefore, the analysis of a trajectory from molecular dynamics rather than of a single static structure is needed for understanding the function of pathways. The identification and analysis of transport pathways are challenging because of the high complexity and diversity of macromolecular shapes, the thermal motion of their atoms, and the large amount of conformations needed to properly describe conformational space of protein structure. In this paper, we describe the principles of the CAVER 3.0 algorithms for the identification and analysis of properties of transport pathways both in static and dynamic structures. Moreover, we introduce the improved clustering solution for finding tunnels in macromolecules, which is included in the latest CAVER 3.02 version. Voronoi diagrams are used to identify potential pathways in each snapshot of a molecular dynamics trajectory and clustering is then used to find the correspondence between tunnels from different snapshots. Furthermore, the geometrical properties of pathways and their evolution in time are computed and visualized.

BetaCavityWeb: a webserver for molecular voids and channels

Molecular cavities, which include voids and channels, are critical for molecular function. We present a webserver, BetaCavityWeb, which computes these cavities for a given molecular structure and a given spherical probe, and reports their geometrical properties: volume, boundary area, buried area, etc. The server's algorithms are based on the Voronoi diagram of atoms and its derivative construct: the beta-complex. The correctness of the computed result and computational efficiency are both mathematically guaranteed. BetaCavityWeb is freely accessible at the Voronoi Diagram Research Center (VDRC) (http://voronoi.hanyang.ac.kr/betacavityweb).

Optimal ligand descriptor for pocket recognition based on the Beta-shape

Structure-based virtual screening is one of the most important and common computational methods for the identification of predicted hit at the beginning of drug discovery. Pocket recognition and definition is frequently a prerequisite of structure-based virtual screening, reducing the search space of the predicted protein-ligand complex. In this paper, we present an optimal ligand shape descriptor for a pocket recognition algorithm based on the beta-shape, which is a derivative structure of the Voronoi diagram of atoms. We investigate six candidates for a shape descriptor for a ligand using statistical analysis: the minimum enclosing sphere, three measures from the principal component analysis of atoms, the van der Waals volume, and the beta-shape volume. Among them, the van der Waals volume of a ligand is the optimal shape descriptor for pocket recognition and best tunes the pocket recognition algorithm based on the beta-shape for efficient virtual screening. The performance of the proposed algorithm is verified by a benchmark test.