6 results on '"José Ignacio Garzón"'
Search Results
2. A computational interactome and functional annotation for the human proteome
- Author
-
José Ignacio Garzón, Sagi Shapira, Diana Murray, Donald Petrey, Lei Deng, and Barry Honig
- Subjects
Proteomics ,0301 basic medicine ,Proteome ,Protein-protein interactions ,QH301-705.5 ,Systems biology ,Science ,Computational biology ,function annotation ,Biology ,Interactome ,protein interactions ,General Biochemistry, Genetics and Molecular Biology ,Protein–protein interaction ,03 medical and health sciences ,Human proteome project ,Humans ,Protein Interaction Maps ,Biology (General) ,Databases, Protein ,Genetics ,General Immunology and Microbiology ,General Neuroscience ,Computational Biology ,Molecular Sequence Annotation ,General Medicine ,Tools and Resources ,030104 developmental biology ,machine learning ,Medicine ,Function (biology) ,Computational and Systems Biology ,Human - Abstract
We present a database, PrePPI (Predicting Protein-Protein Interactions), of more than 1.35 million predicted protein-protein interactions (PPIs). Of these at least 127,000 are expected to constitute direct physical interactions although the actual number may be much larger (~500,000). The current PrePPI, which contains predicted interactions for about 85% of the human proteome, is related to an earlier version but is based on additional sources of interaction evidence and is far larger in scope. The use of structural relationships allows PrePPI to infer numerous previously unreported interactions. PrePPI has been subjected to a series of validation tests including reproducing known interactions, recapitulating multi-protein complexes, analysis of disease associated SNPs, and identifying functional relationships between interacting proteins. We show, using Gene Set Enrichment Analysis (GSEA), that predicted interaction partners can be used to annotate a protein’s function. We provide annotations for most human proteins, including many annotated as having unknown function. DOI: http://dx.doi.org/10.7554/eLife.18715.001
- Published
- 2016
3. Predicting peptide-mediated interactions on a genome-wide scale
- Author
-
Barry Honig, José Ignacio Garzón, Donald Petrey, and T. Scott Chen
- Subjects
Proteomics ,Support Vector Machine ,Bayesian probability ,Protein domain ,Computational biology ,Biology ,computer.software_genre ,Models, Biological ,Interactome ,Protein–protein interaction ,03 medical and health sciences ,Cellular and Molecular Neuroscience ,Bayes' theorem ,Naive Bayes classifier ,Protein structure ,Protein Interaction Mapping ,Genetics ,Humans ,Protein Interaction Domains and Motifs ,Databases, Protein ,Molecular Biology ,lcsh:QH301-705.5 ,Ecology, Evolution, Behavior and Systematics ,030304 developmental biology ,Likelihood Functions ,0303 health sciences ,Ecology ,Genome, Human ,030302 biochemistry & molecular biology ,Computational Biology ,Bayes Theorem ,Computational Theory and Mathematics ,lcsh:Biology (General) ,Modeling and Simulation ,Data mining ,computer ,Algorithms ,Research Article - Abstract
We describe a method to predict protein-protein interactions (PPIs) formed between structured domains and short peptide motifs. We take an integrative approach based on consensus patterns of known motifs in databases, structures of domain-motif complexes from the PDB and various sources of non-structural evidence. We combine this set of clues using a Bayesian classifier that reports the likelihood of an interaction and obtain significantly improved prediction performance when compared to individual sources of evidence and to previously reported algorithms. Our Bayesian approach was integrated into PrePPI, a structure-based PPI prediction method that, so far, has been limited to interactions formed between two structured domains. Around 80,000 new domain-motif mediated interactions were predicted, thus enhancing PrePPI’s coverage of the human protein interactome., Author Summary Complexes formed between a structured domain on one protein and an unstructured peptide on another are ubiquitous. However, they are often quite difficult to detect experimentally. The development of computational approaches to predict domain-motif interactions is therefore an important goal. We report a method to predict domain-motif interactions using a Bayesian approach to integrate evidence from a variety of sources, including three-dimensional structural and non-structural information. The method was applied to the entire human proteome and showed significant improvement over existing methods. The method was incorporated into PrePPI, a computational pipeline for the prediction of protein-protein interactions that relies heavily on structural information. Approximately 80,000 new interactions were detected. The new PrePPI database provides easy access to about 400,000 human protein-protein interactions and should thus constitute a valuable resource in a variety of biological applications including the characterization of molecular interaction networks and, more generally, in the study of interactions mediated by proteins in families that may not be extensively studied experimentally.
- Published
- 2015
4. DrugScorePPI knowledge-based potentials used as scoring and objective function in protein-protein docking
- Author
-
Holger Gohlke, Pablo Chacón, Dennis M. Krüger, and José Ignacio Garzón
- Subjects
Macromolecular Assemblies ,Proteomics ,Mathematical optimization ,Knowledge Bases ,Science ,Biophysics ,Crystallography, X-Ray ,Biochemistry ,Molecular Docking Simulation ,Statistics, Nonparametric ,Engineering ,Software Design ,Protein Interaction Mapping ,Macromolecular Structure Analysis ,Humans ,Protein Interaction Domains and Motifs ,Biomacromolecule-Ligand Interactions ,Protein Interactions ,Protein Structure, Quaternary ,Biology ,Protein structure comparison ,Macromolecular Complex Analysis ,Mathematics ,Lead Finder ,Multidisciplinary ,Software Tools ,Physics ,Protein protein ,Proteins ,Computational Biology ,Software Engineering ,Protein structure prediction ,Protein–ligand docking ,Searching the conformational space for docking ,Docking (molecular) ,Computer Science ,Thermodynamics ,Medicine ,Algorithms ,Software ,Research Article ,Protein Binding - Abstract
The distance-dependent knowledge-based DrugScorePPI potentials, previously developed for in silico alanine scanning and hot spot prediction on given structures of protein-protein complexes, are evaluated as a scoring and objective function for the structure prediction of protein-protein complexes. When applied for ranking >unbound perturbation> (>unbound docking>) decoys generated by Baker and coworkers a 4-fold (1.5-fold) enrichment of acceptable docking solutions in the top ranks compared to a random selection is found. When applied as an objective function in FRODOCK for bound protein-protein docking on 97 complexes of the ZDOCK benchmark 3.0, DrugScorePPI/FRODOCK finds up to 10% (15%) more high accuracy solutions in the top 1 (top 10) predictions than the original FRODOCK implementation. When used as an objective function for global unbound protein-protein docking, fair docking success rates are obtained, which improve by ∼2-fold to 18% (58%) for an at least acceptable solution in the top 10 (top 100) predictions when performing knowledge-driven unbound docking. This suggests that DrugScorePPI balances well several different types of interactions important for protein-protein recognition. The results are discussed in view of the influence of crystal packing and the type of protein-protein complex docked. Finally, a simple criterion is provided with which to estimate a priori if unbound docking with DrugScorePPI/ FRODOCK will be successful. © 2014 Krüger et al.
- Published
- 2014
5. FRODOCK: a new approach for fast rotational protein–protein docking
- Author
-
José Ignacio Garzón, Pablo Chacón, José Ramón López-Blanco, Juan Fernández-Recio, Ruben Abagyan, Julio A. Kovacs, and Carles Pons
- Subjects
Statistics and Probability ,Quantitative Biology::Biomolecules ,Theoretical computer science ,Computer science ,Protein protein ,Computational Biology ,Proteins ,Grid ,Biochemistry ,Original Papers ,Computer Science Applications ,Computational Mathematics ,symbols.namesake ,Computational Theory and Mathematics ,Protein–ligand docking ,Docking (molecular) ,Protein Interaction Mapping ,symbols ,Desolvation ,van der Waals force ,Molecular Biology ,Algorithm ,Algorithms ,Software - Abstract
Motivation: Prediction of protein–protein complexes from the coordinates of their unbound components usually starts by generating many potential predictions from a rigid-body 6D search followed by a second stage that aims to refine such predictions. Here, we present and evaluate a new method to effectively address the complexity and sampling requirements of the initial exhaustive search. In this approach we combine the projection of the interaction terms into 3D grid-based potentials with the efficiency of spherical harmonics approximations to accelerate the search. The binding energy upon complex formation is approximated as a correlation function composed of van der Waals, electrostatics and desolvation potential terms. The interaction-energy minima are identified by a novel, fast and exhaustive rotational docking search combined with a simple translational scanning. Results obtained on standard protein–protein benchmarks demonstrate its general applicability and robustness. The accuracy is comparable to that of existing state-of-the-art initial exhaustive rigid-body docking tools, but achieving superior efficiency. Moreover, a parallel version of the method performs the docking search in just a few minutes, opening new application opportunities in the current ‘omics’ world. Availability: http://sbg.cib.csic.es/Software/FRODOCK/ Contact: Pablo@cib.csic.es Supplementary information: Supplementary data are available at Bioinformatics online.
- Published
- 2009
6. DynaFace: Discrimination between Obligatory and Non-obligatory Protein-Protein Interactions Based on the Complex’s Dynamics
- Author
-
Turkan Haliloglu, Pemra Ozbek, José Ignacio Garzón, Seren Soner, Nir Ben-Tal, Soner, Seren, Ozbek, Pemra, Garzon, Jose Ignacio, Ben-Tal, Nir, and Haliloglu, Turkan
- Subjects
Protein Conformation ,QH301-705.5 ,Putative protein ,Computational biology ,Plasma protein binding ,Molecular Dynamics Simulation ,Biology ,BINDING-SITES ,Protein–protein interaction ,03 medical and health sciences ,Cellular and Molecular Neuroscience ,Molecular dynamics ,symbols.namesake ,QUATERNARY STRUCTURE ,CYTOPLASMIC DOMAIN ,Protein structure ,Protein Interaction Mapping ,Genetics ,CRYSTAL-STRUCTURE ,Biology (General) ,Binding site ,Molecular Biology ,3-DIMENSIONAL STRUCTURE ,Ecology, Evolution, Behavior and Systematics ,030304 developmental biology ,0303 health sciences ,Binding Sites ,Ecology ,030302 biochemistry & molecular biology ,Proteins ,INTERACTION-SITE PREDICTION ,Protein structure prediction ,Kinetics ,Models, Chemical ,STRUCTURAL CLASSIFICATION ,Computational Theory and Mathematics ,Biochemistry ,ESCHERICHIA-COLI ,Multiprotein Complexes ,Modeling and Simulation ,RESIDUES ,symbols ,Gaussian network model ,Algorithms ,Software ,INTERFACES ,Protein Binding ,Research Article - Abstract
Protein-protein interfaces have been evolutionarily-designed to enable transduction between the interacting proteins. Thus, we hypothesize that analysis of the dynamics of the complex can reveal details about the nature of the interaction, and in particular whether it is obligatory, i.e., persists throughout the entire lifetime of the proteins, or not. Indeed, normal mode analysis, using the Gaussian network model, shows that for the most part obligatory and non-obligatory complexes differ in their decomposition into dynamic domains, i.e., the mobile elements of the protein complex. The dynamic domains of obligatory complexes often mix segments from the interacting chains, and the hinges between them do not overlap with the interface between the chains. In contrast, in non-obligatory complexes the interface often hinges between dynamic domains, held together through few anchor residues on one side of the interface that interact with their counterpart grooves in the other end. In automatic analysis, 117 of 139 obligatory (84.2%) and 203 of 246 non-obligatory (82.5%) complexes are correctly classified by our method: DynaFace. We further use DynaFace to predict obligatory and non-obligatory interactions among a set of 300 putative protein complexes. DynaFace is available at: http://safir.prc.boun.edu.tr/dynaface., Author Summary Protein-protein interactions mediate, in essence, all inter- and intra-cellular processes. Thus, understanding their molecular mechanism is of utmost importance. Here we focus on one mechanistic aspect: differentiation between obligatory interactions, which persist throughout the entire lifetime of the protein complex, and non-obligatory, which do not. For proper function, a protein complex should facilitate transduction between the interacting proteins. Therefore the complex’s dynamics should reveal whether it is obligatory or non-obligatory. Indeed, normal mode analysis shows that the dynamic domains of obligatory complexes often mix segments from the interacting chains. In contrast, in non-obligatory complexes the inter-chain interface often hinges between dynamic domains, held together through few anchor residues. An automated methodology based on these observations correctly classifies over 80% of the interfaces in a test set. We use it also to predict obligatory and non-obligatory interactions among putative protein complexes. DynaFace, a web-server implementation of the methodology, is available at: http://safir.prc.boun.edu.tr/dynaface.
- Published
- 2015
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.