Janez Konc

ProBiS algorithm for detection of structurally similar protein binding sites by local structural alignment

Motivation: Exploitation of locally similar 3D patterns of physicochemical properties on the surface of a protein for detection of binding sites that may lack sequence and global structural conservation. Results: An algorithm, ProBiS is described that detects structurally similar sites on protein surfaces by local surface structure alignment. It compares the query protein to members of a database of protein 3D structures and detects with sub-residue precision, structurally similar sites as patterns of physicochemical properties on the protein surface. Using an efficient maximum clique algorithm, the program identifies proteins that share local structural similarities with the query protein and generates structure-based alignments of these proteins with the query. Structural similarity scores are calculated for the query proteins surface residues, and are expressed as different colors on the query protein surface. The algorithm has been used successfully for the detection of protein–protein, protein–small ligand and protein–DNA binding sites. Availability: The software is available, as a web tool, free of charge for academic users at http://probis.cmm.ki.si Contact: dusa@cmm.ki.si Supplementary information: Supplementary data are available at Bioinformatics online.

ProBiS-2012: web server and web services for detection of structurally similar binding sites in proteins

The ProBiS web server is a web server for detection of structurally similar binding sites in the PDB and for local pairwise alignment of protein structures. In this article, we present a new version of the ProBiS web server that is 10 times faster than earlier versions, due to the efficient parallelization of the ProBiS algorithm, which now allows significantly faster comparison of a protein query against the PDB and reduces the calculation time for scanning the entire PDB from hours to minutes. It also features new web services, and an improved user interface. In addition, the new web server is united with the ProBiS-Database and thus provides instant access to pre-calculated protein similarity profiles for over 29 000 non-redundant protein structures. The ProBiS web server is particularly adept at detection of secondary binding sites in proteins. It is freely available at http://probis.cmm.ki.si/old-version, and the new ProBiS web server is at http://probis.cmm.ki.si.

ProBiS: a web server for detection of structurally similar protein binding sites

A web server, ProBiS, freely available at http://probis.cmm.ki.si, is presented. This provides access to the program ProBiS (Protein Binding Sites), which detects protein binding sites based on local structural alignments. Detailed instructions and user guidelines for use of ProBiS are available at the server under ‘HELP’ and selected examples are provided under ‘EXAMPLES’.

ProBiS-database: precalculated binding site similarities and local pairwise alignments of PDB structures.

ProBiS-Database is a searchable repository of precalculated local structural alignments in proteins detected by the ProBiS algorithm in the Protein Data Bank. Identification of functionally important binding regions of the protein is facilitated by structural similarity scores mapped to the query protein structure. PDB structures that have been aligned with a query protein may be rapidly retrieved from the ProBiS-Database, which is thus able to generate hypotheses concerning the roles of uncharacterized proteins. Presented with uncharacterized protein structure, ProBiS-Database can discern relationships between such a query protein and other better known proteins in the PDB. Fast access and a user-friendly graphical interface promote easy exploration of this database of over 420 million local structural alignments. The ProBiS-Database is updated weekly and is freely available online at http://probis.cmm.ki.si/database.

Protein-protein binding-sites prediction by protein surface structure conservation.

A new algorithm to predict protein-protein binding sites using conservation of both protein surface structure and physical-chemical properties in structurally similar proteins is developed. Binding-site residues in proteins are known to be more conserved than the rest of the surface, and finding local surface similarities by comparing a protein to its structural neighbors can potentially reveal the location of binding sites on this protein. This approach, which has previously been used to predict binding sites for small ligands, is now extended to predict protein-protein binding sites. Examples of binding-site predictions for a set of proteins, which have previously been studied for sequence conservation in protein-protein interfaces, are given. The predicted binding sites and the actual binding sites are in good agreement. Our algorithm for finding conserved surface structures in a set of similar proteins is a useful tool for the prediction of protein-protein binding sites.

Discovery of New Inhibitors of d-Alanine:d-Alanine Ligase by Structure-Based Virtual Screening†

The terminal dipeptide, D-Ala-D-Ala, of the peptidoglycan precursor UDPMurNAc-pentapetide is a crucial building block involved in peptidoglycan cross-linking. It is synthesized in the bacterial cytoplasm by the enzyme d-alanine:d-alanine ligase (Ddl). Structure-based virtual screening of the NCI diversity set of almost 2000 compounds was performed with a DdlB isoform from Escherichia coli using the computational tool AutoDock 4.0. The 130 best-ranked compounds from this screen were tested in an in vitro assay for their inhibition of E. coli DdlB. Three compounds were identified that inhibit the enzyme with K(i) values in micromolar range. Two of these also have promising antibacterial activities against Gram-positive and Gram-negative bacteria.

ENZO: a web tool for derivation and evaluation of kinetic models of enzyme catalyzed reactions.

We describe a web tool ENZO (Enzyme Kinetics), a graphical interface for building kinetic models of enzyme catalyzed reactions. ENZO automatically generates the corresponding differential equations from a stipulated enzyme reaction scheme. These differential equations are processed by a numerical solver and a regression algorithm which fits the coefficients of differential equations to experimentally observed time course curves. ENZO allows rapid evaluation of rival reaction schemes and can be used for routine tests in enzyme kinetics. It is freely available as a web tool, at http://enzo.cmm.ki.si.

Exact parallel maximum clique algorithm for general and protein graphs.

A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in two published state of the art sequential algorithms is implemented. The new sequential MaxCliqueSeq algorithm is faster than the reference algorithms on both DIMACS benchmark graphs as well as on protein-derived product graphs used for protein structural comparisons. Next, the MaxCliqueSeq algorithm is parallelized by splitting the branch-and-bound search tree to multiple cores, resulting in MaxCliquePara algorithm. The ability to exploit all cores efficiently makes the new parallel MaxCliquePara algorithm markedly superior to other tested algorithms. On a 12-core computer, the parallelization provides up to 2 orders of magnitude faster execution on the large DIMACS benchmark graphs and up to an order of magnitude faster execution on protein product graphs. The algorithms are freely accessible on http://commsys.ijs.si/~matjaz/maxclique.

ProBiS-ligands: a web server for prediction of ligands by examination of protein binding sites

The ProBiS-ligands web server predicts binding of ligands to a protein structure. Starting with a protein structure or binding site, ProBiS-ligands first identifies template proteins in the Protein Data Bank that share similar binding sites. Based on the superimpositions of the query protein and the similar binding sites found, the server then transposes the ligand structures from those sites to the query protein. Such ligand prediction supports many activities, e.g. drug repurposing. The ProBiS-ligands web server, an extension of the ProBiS web server, is open and free to all users at http://probis.cmm.ki.si/ligands.

ProBiS-CHARMMing: Web Interface for Prediction and Optimization of Ligands in Protein Binding Sites.

Proteins often exist only as apo structures (unligated) in the Protein Data Bank, with their corresponding holo structures (with ligands) unavailable. However, apoproteins may not represent the amino-acid residue arrangement upon ligand binding well, which is especially problematic for molecular docking. We developed the ProBiS-CHARMMing web interface by connecting the ProBiS ( http://probis.cmm.ki.si ) and CHARMMing ( http://www.charmming.org ) web servers into one functional unit that enables prediction of protein-ligand complexes and allows for their geometry optimization and interaction energy calculation. The ProBiS web server predicts ligands (small compounds, proteins, nucleic acids, and single-atom ligands) that may bind to a query protein. This is achieved by comparing its surface structure against a nonredundant database of protein structures and finding those that have binding sites similar to that of the query protein. Existing ligands found in the similar binding sites are then transposed to the query according to predictions from ProBiS. The CHARMMing web server enables, among other things, minimization and potential energy calculation for a wide variety of biomolecular systems, and it is used here to optimize the geometry of the predicted protein-ligand complex structures using the CHARMM force field and to calculate their interaction energies with the corresponding query proteins. We show how ProBiS-CHARMMing can be used to predict ligands and their poses for a particular binding site, and minimize the predicted protein-ligand complexes to obtain representations of holoproteins. The ProBiS-CHARMMing web interface is freely available for academic users at http://probis.nih.gov.