PubMed Health⌕ Search

Biomedical subjects

Haim J Wolfson

Publications and source records attributed to Haim J Wolfson.

At least 19 recordsLinked to original sources

A hierarchical protein folding scheme based on the building block folding model.

The building block protein folding model states that the native protein structure is the product of a combinatorial assembly of relatively structurally independent contiguous parts of the protein that possess a hydrophobic core, i.e., building blocks (BBs). According to this model, our group proposed a three-stage scheme for a feasible time-wise semi ab-intio protein structure prediction. Given a protein sequence, at the first stage of the prediction scheme, we propose cutting the sequence into structurally assigned BBs. Next, we perform a combinatorial assembly and attempt to predict the relative three-dimensional arrangement of the BBs. In the third stage, we refine and rank the assemblies. The scheme has proven to be very promising in reducing the complexity of the protein folding problem and gaining insight into the protein folding process. In this chapter, we describe the different stages of the scheme and discuss a possible application of the model to protein design.

Algorithms↗

The ARTS web server for aligning RNA tertiary structures.

RNA molecules with common structural features may share similar functional properties. Structural comparison of RNAs and detection of common substructures is, thus, a highly important task. Nevertheless, the current available tools in the RNA community provide only a partial solution, since they either work at the 2D level or are suitable for detecting predefined or local contiguous tertiary motifs only. Here, we describe a web server built around ARTS, a method for aligning tertiary structures of nucleic acids (both RNA and DNA). ARTS receives a pair of 3D nucleic acid structures and searches for a priori unknown common substructures. The search is truly 3D and irrespective of the order of the nucleotides on the chain. The identified common substructures can be large global folds with hundreds and even thousands of nucleotides as well as small local motifs with at least two successive base pairs. The method is highly efficient and has been used to conduct an all-against-all comparison of all the RNA structures in the Protein Data Bank. The web server together with a software package for download are freely accessible at http://bioinfo3d.cs.tau.ac.il/ARTS.

Internet↗

A permissive secondary structure-guided superposition tool for clustering of protein fragments toward protein structure prediction via fragment assembly.

MOTIVATION: Secondary-Structure Guided Superposition tool (SSGS) is a permissive secondary structure-based algorithm for matching of protein structures and in particular their fragments. The algorithm was developed towards protein structure prediction via fragment assembly. RESULTS: In a fragment-based structural prediction scheme, a protein sequence is cut into building blocks (BBs). The BBs are assembled to predict their relative 3D arrangement. Finally, the assemblies are refined. To implement this prediction scheme, a clustered structural library representing sequence patterns for protein fragments is essential. To create a library, BBs generated by cutting proteins from the PDB are compared and structurally similar BBs are clustered. To allow structural comparison and clustering of the BBs, which are often relatively short with flexible loops, we have devised SSGS. SSGS maintains high similarity between cluster members and is highly efficient. When it comes to comparing BBs for clustering purposes, the algorithm obtains better results than other, non-secondary structure guided protein superimposition algorithms.

Algorithms↗

Optimization of multiple-sequence alignment based on multiple-structure alignment.

Routinely used multiple-sequence alignment methods use only sequence information. Consequently, they may produce inaccurate alignments. Multiple-structure alignment methods, on the other hand, optimize structural alignment by ignoring sequence information. Here, we present an optimization method that unifies sequence and structure information. The alignment score is based on standard amino acid substitution probabilities combined with newly computed three-dimensional structure alignment probabilities. The advantage of our alignment scheme is in its ability to produce more accurate multiple alignments. We demonstrate the usefulness of the method in three applications: 1) computing more accurate multiple-sequence alignments, 2) analyzing protein conformational changes, and 3) computation of amino acid structure-sequence conservation with application to protein-protein docking prediction. The method is available at http://bioinfo3d.cs.tau.ac.il/staccato/.

Amino Acid Sequence↗

The multiple common point set problem and its application to molecule binding pattern detection.

Recognition of binding patterns common to a set of protein structures is important for recognition of function, prediction of binding, and drug design. We consider protein binding sites represented by a set of 3D points with assigned physico-chemical and geometrical properties important for protein-ligand interactions. We formulate the multiple binding site alignment problem as detection of the largest common set of such 3D points. We discuss the computational problem of multiple common point set detection and, particularly, the matching problem in K-partite-epsilon graphs, where K partitions are associated with K structures and edges are defined between epsilon-close points. We show that the K-partite-epsilon matching problem is NP-hard in the Euclidean space with dimension larger than one. Consequently, we show that the largest common point set problem between three point sets is NP-hard. On the practical side, we present a novel computational method, MultiBind, for recognition of binding patterns common to a set of protein structures. It performs a multiple alignment between protein binding sites in the absence of overall sequence, fold, or binding partner similarity. Despite the NP-hardness results, in our applications, we practically overcome the exponential number of multiple alignment combinations by applying an efficient branchand- bound filtering procedure. We show applications of MultiBind to several biological targets. The method recognizes patterns which are responsible for binding small molecules, such as estradiol, ATP/ANP, and transition state analogues.

Adenosine Triphosphate↗

Combinatorial docking approach for structure prediction of large proteins and multi-molecular assemblies.

Protein folding and protein binding are similar processes. In both, structural units combinatorially associate with each other. In the case of folding, we mostly handle relatively small units, building blocks or domains, that are covalently linked. In the case of multi-molecular binding, the subunits are relatively large and are associated only by non-covalent bonds. Experimentally, the difficulty in the determination of the structures of such large assemblies increases with the complex size and the number of components it contains. Computationally, the prediction of the structures of multi-molecular complexes has largely not been addressed, probably owing to the magnitude of the combinatorial complexity of the problem. Current docking algorithms mostly target prediction of pairwise interactions. Here our goal is to predict the structures of multi-unit associations, whether these are chain-connected as in protein folding, or separate disjoint molecules in the assemblies. We assume that the structures of the single units are known, either through experimental determination or modeling. Our aim is to combinatorially assemble these units to predict their structure. To address this problem we have developed CombDock. CombDock is a combinatorial docking algorithm for the structural units assembly problem. Below, we briefly describe the algorithm and present examples of its various applications to folding and to multi-molecular assemblies. To test the robustness of the algorithm, we use inaccurate models of the structural units, derived either from crystal structures of unbound molecules or from modeling of the target sequences. The algorithm has been able to predict near-native arrangements of the input structural units in almost all of the cases, suggesting that a combinatorial approach can overcome the imperfect shape complementarity caused by the inaccuracy of the models. In addition, we further show that through a combinatorial docking strategy it is possible to enhance the predictions of pairwise interactions involved in a multi-molecular assembly.

Algorithms↗

Generation and analysis of a protein-protein interface data set with similar chemical and spatial patterns of interactions.

Protein-protein interfaces are regions between 2 polypeptide chains that are not covalently connected. Here, we have created a nonredundant interface data set generated from all 2-chain interfaces in the Protein Data Bank. This data set is unique, since it contains clusters of interfaces with similar shapes and spatial organization of chemical functional groups. The data set allows statistical investigation of similar interfaces, as well as the identification and analysis of the chemical forces that account for the protein-protein associations. Toward this goal, we have developed I2I-SiteEngine (Interface-to-Interface SiteEngine) [Data set available at http://bioinfo3d.cs.tau.ac.il/Interfaces; Web server: http://bioinfo3d.cs.tau.ac.il/I2I-SiteEngine]. The algorithm recognizes similarities between protein-protein binding surfaces. I2I-SiteEngine is independent of the sequence or the fold of the proteins that comprise the interfaces. In addition to geometry, the method takes into account both the backbone and the side-chain physicochemical properties of the interacting atom groups. Its high efficiency makes it suitable for large-scale database searches and classifications. Below, we briefly describe the I2I-SiteEngine method. We focus on the classification process and the obtained nonredundant protein-protein interface data set. In particular, we analyze the biological significance of the clusters and present examples which illustrate that given constellations of chemical groups in protein-protein binding sites may be preferred, and are observed in proteins with different structures and different functions. We expect that these would yield further information regarding the forces stabilizing protein-protein interactions.

Chemical Phenomena↗

Approaching the CAPRI challenge with an efficient geometry-based docking.

The last 3 rounds (3-5) of CAPRI included a wide range of docking targets. Several targets were especially challenging, since they involved large-scale movements and symmetric rearrangement, while others were based on homology models. We have approached the targets with a variety of geometry-based docking algorithms that include rigid docking, symmetric docking, and flexible docking with symmetry constraints. For all but 1 docking target, we were able to submit at least 1 acceptable quality prediction. Here, we detail for each target the prediction methods used and the specific biological data employed, and supply a retrospective analysis of the results. We highlight the advantages of our techniques, which efficiently exploit the geometric shape complementarity properties of the interaction. These enable them to run only few minutes on a standard PC even for flexible docking, thus proving their scalability toward computational genomic scale experiments. We also outline the major required enhancements, such as the introduction of side-chain position refinement and the introduction of flexibility for both docking partners.

Algorithms↗

Geometry-based flexible and symmetric protein docking.

We present a set of geometric docking algorithms for rigid, flexible, and cyclic symmetry docking. The algorithms are highly efficient and have demonstrated very good performance in CAPRI Rounds 3-5. The flexible docking algorithm, FlexDock, is unique in its ability to handle any number of hinges in the flexible molecule, without degradation in run-time performance, as compared to rigid docking. The algorithm for reconstruction of cyclically symmetric complexes successfully assembles multimolecular complexes satisfying C(n) symmetry for any n in a matter of minutes on a desktop PC. Most of the algorithms presented here are available at the Tel Aviv University Structural Bioinformatics Web server (http://bioinfo3d.cs.tau.ac.il/).

Algorithms↗

PatchDock and SymmDock: servers for rigid and symmetric docking.

Here, we describe two freely available web servers for molecular docking. The PatchDock method performs structure prediction of protein-protein and protein-small molecule complexes. The SymmDock method predicts the structure of a homomultimer with cyclic symmetry given the structure of the monomeric unit. The inputs to the servers are either protein PDB codes or uploaded protein structures. The services are available at http://bioinfo3d.cs.tau.ac.il. The methods behind the servers are very efficient, allowing large-scale docking experiments.

Algorithms↗

SiteEngines: recognition and comparison of binding sites and protein-protein interfaces.

Protein surface regions with similar physicochemical properties and shapes may perform similar functions and bind similar binding partners. Here we present two web servers and software packages for recognition of the similarity of binding sites and interfaces. Both methods recognize local geometrical and physicochemical similarity, which can be present even in the absence of overall sequence or fold similarity. The first method, SiteEngine (http:/bioinfo3d.cs.tau.ac.il/SiteEngine), receives as an input two protein structures and searches the complete surface of one protein for regions similar to the binding site of the other. The second, Interface-to-Interface (I2I)-SiteEngine (http:/bioinfo3d.cs.tau.ac.il/I2I-SiteEngine), compares protein-protein interfaces, which are regions of interaction between two protein molecules. It receives as an input two structures of protein-protein complexes, extracts the interfaces and finds the three-dimensional transformation that maximizes the similarity between two pairs of interacting binding sites. The output of both servers consists of a superimposition in PDB file format and a list of physicochemical properties shared by the compared entities. The methods are highly efficient and the freely available software packages are suitable for large-scale database searches of the entire PDB.

Amino Acids↗

Prediction of multimolecular assemblies by multiple docking.

The majority of proteins function when associated in multimolecular assemblies. Yet, prediction of the structures of multimolecular complexes has largely not been addressed, probably due to the magnitude of the combinatorial complexity of the problem. Docking applications have traditionally been used to predict pairwise interactions between molecules. We have developed an algorithm that extends the application of docking to multimolecular assemblies. We apply it to predict quaternary structures of both oligomers and multi-protein complexes. The algorithm predicted well a near-native arrangement of the input subunits for all cases in our data set, where the number of the subunits of the different target complexes varied from three to ten. In order to simulate a more realistic scenario, unbound cases were tested. In these cases the input conformations of the subunits are either unbound conformations of the subunits or a model obtained by a homology modeling technique. The successful predictions of the unbound cases, where the input conformations of the subunits are different from their conformations within the target complex, suggest that the algorithm is robust. We expect that this type of algorithm should be particularly useful to predict the structures of large macromolecular assemblies, which are difficult to solve by experimental structure determination.

Algorithms↗

From structure to function: methods and applications.

The rapid increase in experimental data along with recent progress in computational methods has brought modern biology a step closer toward solving one of the most challenging problems: prediction of protein function. Comprehension of protein function at its most basic level requires understanding of molecular interactions. Currently, it is becoming universally accepted that the scale of the accumulated data for analysis and for prediction necessitate highly efficient computational tools with appropriate application capabilities. The review presents the up-to-date advances in computational methods for structural pattern discovery and for prediction of molecular associations. We focus on their applications toward a range of biological problems and highlight the advantages of the combination of these methods and their integration with biological experiments. We provide examples, synergistically merging structural modeling, rigid and flexible structural alignment and detection of conserved structural patterns and docking (rigid and flexible with hinge-bending movements). We hope the review will lead to a broader utilization of computational methods, and their cross-fertilization with experiment.

Algorithms↗

A method for simultaneous alignment of multiple protein structures.

Here, we present MultiProt, a fully automated highly efficient technique to detect multiple structural alignments of protein structures. MultiProt finds the common geometrical cores between input molecules. To date, most methods for multiple alignment start from the pairwise alignment solutions. This may lead to a small overall alignment. In contrast, our method derives multiple alignments from simultaneous superpositions of input molecules. Further, our method does not require that all input molecules participate in the alignment. Actually, it efficiently detects high scoring partial multiple alignments for all possible number of molecules in the input. To demonstrate the power of MultiProt, we provide a number of case studies. First, we demonstrate known multiple alignments of protein structures to illustrate the performance of MultiProt. Next, we present various biological applications. These include: (1) a partial alignment of hinge-bent domains; (2) identification of functional groups of G-proteins; (3) analysis of binding sites; and (4) protein-protein interface alignment. Some applications preserve the sequence order of the residues in the alignment, whereas others are order-independent. It is their residue sequence order-independence that allows application of MultiProt to derive multiple alignments of binding sites and of protein-protein interfaces, making MultiProt an extremely useful structural tool.

Algorithms↗

BioInfo3D: a suite of tools for structural bioinformatics.

Here, we describe BioInfo3D, a suite of freely available web services for protein structural analysis. The FlexProt method performs flexible structural alignment of protein molecules. FlexProt simultaneously detects the hinge regions and aligns the rigid subparts of the molecules. It does not require an a priori knowledge of the flexible hinge regions. MultiProt and MASS perform simultaneous comparison of multiple protein structures. PatchDock performs prediction of protein-protein and protein-small molecule interactions. The input to all services is either protein PDB codes or protein structures uploaded to the server. All the services are available at http://bioinfo3d.cs.tau.ac.il.

Algorithms↗

Recognition of functional sites in protein structures.

Recognition of regions on the surface of one protein, that are similar to a binding site of another is crucial for the prediction of molecular interactions and for functional classifications. We first describe a novel method, SiteEngine, that assumes no sequence or fold similarities and is able to recognize proteins that have similar binding sites and may perform similar functions. We achieve high efficiency and speed by introducing a low-resolution surface representation via chemically important surface points, by hashing triangles of physico-chemical properties and by application of hierarchical scoring schemes for a thorough exploration of global and local similarities. We proceed to rigorously apply this method to functional site recognition in three possible ways: first, we search a given functional site on a large set of complete protein structures. Second, a potential functional site on a protein of interest is compared with known binding sites, to recognize similar features. Third, a complete protein structure is searched for the presence of an a priori unknown functional site, similar to known sites. Our method is robust and efficient enough to allow computationally demanding applications such as the first and the third. From the biological standpoint, the first application may identify secondary binding sites of drugs that may lead to side-effects. The third application finds new potential sites on the protein that may provide targets for drug design. Each of the three applications may aid in assigning a function and in classification of binding patterns. We highlight the advantages and disadvantages of each type of search, provide examples of large-scale searches of the entire Protein Data Base and make functional predictions.

Algorithms↗

Identification of the N-terminal peptide binding site of glucose-regulated protein 94.

Because the stress protein GRP94 can augment presentation of peptides to T cells, it is important to define how it, as well as all other HSP90 family members, binds peptides. Having previously shown that the N-terminal half of GRP94 can account for the peptide binding activity of the full-length protein, we now locate this binding site by testing predictions of a molecular docking model. The best predicted site was on the opposite face of the beta sheet from the pan-HSP90 radicicol-binding pocket, in close proximity to a deep hydrophobic pocket. The peptide and radicicol-binding sites are distinct, as shown by the ability of a radicicol-refractive mutant to bind peptide. When the fluorophore acrylodan is attached to Cys117 within the hydrophobic pocket, its fluorescence is reduced upon peptide binding, consistent with proximity of the two ligands. Substitution of His125, which contacts the bound peptide, compromises peptide-binding activity. We conclude that peptide binds to the concave face of the beta sheet of the N-terminal domain, where binding is regulated during the action cycle of the chaperone.

Amino Acid Sequence↗

Side chain interactions determine the amyloid organization: a single layer beta-sheet molecular structure of the calcitonin peptide segment 15-19.

In this paper we present a detailed atomic model for a protofilament, the most basic organization level, of the amyloid fibre formed by the peptide DFNKF. This pentapeptide is a segment derived from the human calcitonin, a natural amyloidogenic protein. Our model, which represents the outcome of extensive explicit solvent molecular dynamics (MD) simulations of different strand/sheet organizations, is a single beta-sheet filament largely without a hydrophobic core. Nevertheless, this structure is capable of reproducing the main features of the characteristic amyloid fibril organization and provides clues to the molecular basis of its experimental aggregation behaviour. Our results show that the side chains' chemical diversity induces the formation of a complex network of interactions that finally determine the microscopic arrangement of the strands at the protofilament level. This network of interactions, consisting of both side chain-side chain and backbone-side chain interactions, confers on the final single beta-sheet arrangement an unexpected stability, both by enhancing the association of related chemical groups and, at the same time, by shielding the hydrophobic segments from the polar solvent. The chemical physical characterization of this protofilament provides hints to the possible thermodynamical basis of the supra molecular organization that allows the formation of the filaments by lateral association of the preformed protofibrils. Its regular, highly polarized structure shows how other protofilaments can assemble. In terms of structural biology, our results clearly indicate that an amyloid organization implies a degree of complexity far beyond a simple nonspecific association of peptide strands via amide hydrogen bonds.

Amino Acid Sequence↗