Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

BIPS: BIANA Interolog Prediction Server. A tool for protein-protein interaction inference

  • García-García, Javier, 1982-
  • Schleker, Sylvia
  • Klein-Seetharaman, Judith
  • Oliva Miguel, Baldomero
Protein-protein interactions (PPIs) play a crucial role in biology, and high-throughput experiments have greatly increased the coverage of known interactions. Still, identification of complete inter- and intraspecies interactomes is far from being complete. Experimental data can be complemented by the prediction of PPIs within an organism or between two organisms based on the known interactions of the orthologous genes of other organisms (interologs). Here, we present the BIANA (Biologic Interactions and Network Analysis) Interolog Prediction Server (BIPS), which offers a web-based interface to facilitate PPI predictions based on interolog information. BIPS benefits from the capabilities of the framework BIANA to integrate the several PPI-related databases. Additional metadata can be used to improve the reliability of the predicted interactions. Sensitivity and specificity of the server have been calculated using known PPIs from different interactomes using a leave-one-out approach. The specificity is between 72 and 98%, whereas sensitivity varies between 1 and 59%, depending on the sequence identity cut-off used to calculate similarities between sequences. BIPS is freely accessible at http://sbi.imim.es/BIPS.php., This work was funded by the Spanish Ministry of Science and Innovation (MICINN); partners of the ERASysBio+ initiative supported under the EU ERA-NET Plus scheme in FP7 (SHIPREC) Euroinvestigación [EUI2009-04018], as well as FEDER [BIO2011-22568, PSE-0100000-2009]
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Integrating structure to protein-protein interaction networks that drive metastasis to brain and lung in breast cancer

  • Engin, H Billur
  • Güney, Emre, 1983-
  • Keskin, Ozlem
  • Oliva Miguel, Baldomero
  • Gursoy, Attila
Blocking specific protein interactions can lead to human diseases. Accordingly, protein interactions and the structural knowledge on interacting surfaces of proteins (interfaces) have an important role in predicting the genotype-phenotype relationship. We have built the phenotype specific sub-networks of protein-protein interactions (PPIs) involving the relevant genes responsible for lung and brain metastasis from primary tumor in breast cancer. First, we selected the PPIs most relevant to metastasis causing genes (seed genes), by using the “guilt-by-association” principle. Then, we modeled structures of the interactions whose complex forms are not available in Protein Databank (PDB). Finally, we mapped mutations to interface structures (real and modeled), in order to spot the interactions that might be manipulated by these mutations. Functional analyses performed on these sub-networks revealed the potential relationship between immune system-infectious diseases and lung metastasis progression, but this connection was not observed significantly in the brain metastasis. Besides, structural analyses showed that some PPI interfaces in both metastasis sub-networks are originating from microbial proteins, which in turn were mostly related with cell adhesion. Cell adhesion is a key mechanism in metastasis, therefore these PPIs may be involved in similar molecular pathways that are shared by infectious disease and metastasis. Finally, by mapping the mutations and amino acid variations on the interface regions of the proteins in the metastasis sub-networks we found evidence for some mutations to be involved in the mechanisms differentiating the type of the metastasis., This work is supported by Spanish Government (MINECO) grant FEDER BIO2011-22568 and EUI2009-04018 (ERASysBio + SHIPREC) and The Scientific and Technological Research Council of Turkey (TUBITAK) grant 113E164.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Inferring causal molecular networks: empirical assessment through a community-based effor

  • Hill, Steven M.
  • Anton, Bernat
  • Bonet Martínez, Jaume, 1982-
  • García-García, Javier, 1982-
  • Oliva Miguel, Baldomero
  • Planas Iglesias, Joan, 1980-
  • Poglayen, Daniel, 1984-
  • Mukherjee, Sach
  • The HPN-DREAM Consortium
It remains unclear whether causal, rather than merely correlational, relationships in molecular networks can be inferred in complex biological settings. Here we describe the HPN-DREAM network inference challenge, which focused on learning causal influences in signaling networks. We used phosphoprotein data from cancer cell lines as well as in silico data from a nonlinear dynamical model. Using the phosphoprotein data, we scored more than 2,000 networks submitted by challenge participants. The networks spanned 32 biological contexts and were scored in terms of causal validity with respect to unseen interventional data. A number of approaches were effective, and incorporating known biology was generally advantageous. Additional sub-challenges considered time-course prediction and visualization. Our results suggest that learning causal relationships may be feasible in complex settings such as disease states. Furthermore, our scoring approach provides a practical way to empirically assess inferred molecular networks in a causal sense., This work was supported in part by the US National Institutes of Health (National Cancer Institute (NCI) grants U54 CA 112970 (to J.W.G.) and 5R01CA180778 (to J.M.S.), NCI award U54CA143869 to M.F.C. and National Institute of General Medical Sciences award 1R01GM109031 to J.M.S.), the Susan G. Komen Foundation (SAC110012 to J.W.G.), the Prospect Creek Foundation (grant to J.W.G.), the EuroinvesXgacion program of MICINN (Spanish Ministry of Science and InnovaXon), partners of the ERASysBio+ iniXaXve supported under the EU ERA-NET Plus Scheme in FP7 (SHIPREC), MICINN (FEDER BIO2008-0205, FEDER BIO2011-22568 and EUI2009-04018 to B.O.), the Royal Society (Wolfson Research Merit Award to S.M.), the German Federal Ministry of Education and Research GANI_MED Consortium (grant 03IS2061A to T.K.), and the US National Library of Medicine (grants R00LM010822 (to X.J.) and R01LM011663 (to X.J. and R.E.N.))
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

ArchDB 2014: structural classification of loops in proteins

  • Bonet Martínez, Jaume, 1982-
  • Planas Iglesias, Joan, 1980-
  • García-García, Javier, 1982-
  • Marín López, Manuel Alejandro, 1987-
  • Fernández Fuentes, Narcís
  • Oliva Miguel, Baldomero
The function of a protein is determined by its three-dimensional structure, which is formed by regular (i.e. β-strands and α-helices) and non-periodic structural units such as loops. Compared to regular structural elements, non-periodic, non-repetitive conformational units enclose a much higher degree of variability--raising difficulties in the identification of regularities, and yet represent an important part of the structure of a protein. Indeed, loops often play a pivotal role in the function of a protein and different aspects of protein folding and dynamics. Therefore, the structural classification of protein loops is an important subject with clear applications in homology modelling, protein structure prediction, protein design (e.g. enzyme design and catalytic loops) and function prediction. ArchDB, the database presented here (freely available at http://sbi.imim.es/archdb), represents such a resource and has been an important asset for the scientific community throughout the years. In this article, we present a completely reworked and updated version of ArchDB. The new version of ArchDB features a novel, fast and user-friendly web-based interface, and a novel graph-based, computationally efficient, clustering algorithm. The current version of ArchDB classifies 149,134 loops in 5739 classes and 9608 subclasses., This work has been funded by the Spanish Ministry of Science and Innovation (MICINN) [FEDER BIO2008-0205, FEDER BIO2011-22568, EUI2009-04018]; FI-DGR 2012 fellowship from/n‘Generalitat de Catalunya’ (to M.A.M.L.). Funding for open access charge: Spanish Ministry of Science and Innovation
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Integrating structure to protein-protein interaction networks that drive metastasis to brain and lung in breast cancer

  • Engin, H Billur
  • Güney, Emre, 1983-
  • Keskin, Ozlem
  • Oliva Miguel, Baldomero
  • Gursoy, Attila
Blocking specific protein interactions can lead to human diseases. Accordingly, protein interactions and the structural knowledge on interacting surfaces of proteins (interfaces) have an important role in predicting the genotype-phenotype relationship. We have built the phenotype specific sub-networks of protein-protein interactions (PPIs) involving the relevant genes responsible for lung and brain metastasis from primary tumor in breast cancer. First, we selected the PPIs most relevant to metastasis causing genes (seed genes), by using the “guilt-by-association” principle. Then, we modeled structures of the interactions whose complex forms are not available in Protein Databank (PDB). Finally, we mapped mutations to interface structures (real and modeled), in order to spot the interactions that might be manipulated by these mutations. Functional analyses performed on these sub-networks revealed the potential relationship between immune system-infectious diseases and lung metastasis progression, but this connection was not observed significantly in the brain metastasis. Besides, structural analyses showed that some PPI interfaces in both metastasis sub-networks are originating from microbial proteins, which in turn were mostly related with cell adhesion. Cell adhesion is a key mechanism in metastasis, therefore these PPIs may be involved in similar molecular pathways that are shared by infectious disease and metastasis. Finally, by mapping the mutations and amino acid variations on the interface regions of the proteins in the metastasis sub-networks we found evidence for some mutations to be involved in the mechanisms differentiating the type of the metastasis., This work is supported by Spanish Government (MINECO) grant FEDER BIO2011-22568 and EUI2009-04018 (ERASysBio + SHIPREC) and The Scientific and Technological Research Council of Turkey (TUBITAK) grant 113E164.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Inferring causal molecular networks: empirical assessment through a community-based effor

  • Hill, Steven M.
  • Anton, Bernat
  • Bonet Martínez, Jaume, 1982-
  • García-García, Javier, 1982-
  • Oliva Miguel, Baldomero
  • Planas Iglesias, Joan, 1980-
  • Poglayen, Daniel, 1984-
  • Mukherjee, Sach
  • The HPN-DREAM Consortium
It remains unclear whether causal, rather than merely correlational, relationships in molecular networks can be inferred in complex biological settings. Here we describe the HPN-DREAM network inference challenge, which focused on learning causal influences in signaling networks. We used phosphoprotein data from cancer cell lines as well as in silico data from a nonlinear dynamical model. Using the phosphoprotein data, we scored more than 2,000 networks submitted by challenge participants. The networks spanned 32 biological contexts and were scored in terms of causal validity with respect to unseen interventional data. A number of approaches were effective, and incorporating known biology was generally advantageous. Additional sub-challenges considered time-course prediction and visualization. Our results suggest that learning causal relationships may be feasible in complex settings such as disease states. Furthermore, our scoring approach provides a practical way to empirically assess inferred molecular networks in a causal sense., This work was supported in part by the US National Institutes of Health (National Cancer Institute (NCI) grants U54 CA 112970 (to J.W.G.) and 5R01CA180778 (to J.M.S.), NCI award U54CA143869 to M.F.C. and National Institute of General Medical Sciences award 1R01GM109031 to J.M.S.), the Susan G. Komen Foundation (SAC110012 to J.W.G.), the Prospect Creek Foundation (grant to J.W.G.), the EuroinvesXgacion program of MICINN (Spanish Ministry of Science and InnovaXon), partners of the ERASysBio+ iniXaXve supported under the EU ERA-NET Plus Scheme in FP7 (SHIPREC), MICINN (FEDER BIO2008-0205, FEDER BIO2011-22568 and EUI2009-04018 to B.O.), the Royal Society (Wolfson Research Merit Award to S.M.), the German Federal Ministry of Education and Research GANI_MED Consortium (grant 03IS2061A to T.K.), and the US National Library of Medicine (grants R00LM010822 (to X.J.) and R01LM011663 (to X.J. and R.E.N.))
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

BIPS: BIANA Interolog Prediction Server. A tool for protein-protein interaction inference

  • García-García, Javier, 1982-
  • Schleker, Sylvia
  • Klein-Seetharaman, Judith
  • Oliva Miguel, Baldomero
Protein-protein interactions (PPIs) play a crucial role in biology, and high-throughput experiments have greatly increased the coverage of known interactions. Still, identification of complete inter- and intraspecies interactomes is far from being complete. Experimental data can be complemented by the prediction of PPIs within an organism or between two organisms based on the known interactions of the orthologous genes of other organisms (interologs). Here, we present the BIANA (Biologic Interactions and Network Analysis) Interolog Prediction Server (BIPS), which offers a web-based interface to facilitate PPI predictions based on interolog information. BIPS benefits from the capabilities of the framework BIANA to integrate the several PPI-related databases. Additional metadata can be used to improve the reliability of the predicted interactions. Sensitivity and specificity of the server have been calculated using known PPIs from different interactomes using a leave-one-out approach. The specificity is between 72 and 98%, whereas sensitivity varies between 1 and 59%, depending on the sequence identity cut-off used to calculate similarities between sequences. BIPS is freely accessible at http://sbi.imim.es/BIPS.php., This work was funded by the Spanish Ministry of Science and Innovation (MICINN); partners of the ERASysBio+ initiative supported under the EU ERA-NET Plus scheme in FP7 (SHIPREC) Euroinvestigación [EUI2009-04018], as well as FEDER [BIO2011-22568, PSE-0100000-2009]
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

ArchDB 2014: structural classification of loops in proteins

  • Bonet Martínez, Jaume, 1982-
  • Planas Iglesias, Joan, 1980-
  • García-García, Javier, 1982-
  • Marín López, Manuel Alejandro, 1987-
  • Fernández Fuentes, Narcís
  • Oliva Miguel, Baldomero
The function of a protein is determined by its three-dimensional structure, which is formed by regular (i.e. β-strands and α-helices) and non-periodic structural units such as loops. Compared to regular structural elements, non-periodic, non-repetitive conformational units enclose a much higher degree of variability--raising difficulties in the identification of regularities, and yet represent an important part of the structure of a protein. Indeed, loops often play a pivotal role in the function of a protein and different aspects of protein folding and dynamics. Therefore, the structural classification of protein loops is an important subject with clear applications in homology modelling, protein structure prediction, protein design (e.g. enzyme design and catalytic loops) and function prediction. ArchDB, the database presented here (freely available at http://sbi.imim.es/archdb), represents such a resource and has been an important asset for the scientific community throughout the years. In this article, we present a completely reworked and updated version of ArchDB. The new version of ArchDB features a novel, fast and user-friendly web-based interface, and a novel graph-based, computationally efficient, clustering algorithm. The current version of ArchDB classifies 149,134 loops in 5739 classes and 9608 subclasses., This work has been funded by the Spanish Ministry of Science and Innovation (MICINN) [FEDER BIO2008-0205, FEDER BIO2011-22568, EUI2009-04018]; FI-DGR 2012 fellowship from/n‘Generalitat de Catalunya’ (to M.A.M.L.). Funding for open access charge: Spanish Ministry of Science and Innovation