STRING - Cross-species integration of known and predicted protein-protein interactions


Published on

University of Southern California, Los Angeles, California, December 15, 2005

Published in: Technology
  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide
  • STRING - Cross-species integration of known and predicted protein-protein interactions

    1. 1. STRING Cross-species integration of known and predicted protein-protein interactions Lars Juhl Jensen EMBL Heidelberg
    2. 2. STRING provides a protein network based on integration of diverse types of evidence Genomic neighborhood Species co-occurrence Gene fusions Database imports Exp. interaction data Microarray expression data Literature co-mentioning
    3. 3. Inferring functional modules from gene presence/absence patterns T Resting protuberances Protracted protuberance Cellulose © Trends Microbiol, 1999 Cell Cell wall Anchoring proteins Cellulosomes Cellulose The “Cellulosome”
    4. 4. Genomic context methods © Nature Biotechnology, 2004
    5. 5. Formalizing the phylogenetic profile method Align all proteins against all Calculate best-hit profile Join similar species by PCA Calculate PC profile distances Calibrate against KEGG maps
    6. 6. Predicting functional and physical interactions from gene fusion/fission events Find in A genes that match a the same gene in B Exclude overlapping alignments Calibrate against KEGG maps Calculate all-against-all pairwise alignments
    7. 7. Inferring functional associations from evolutionarily conserved operons Identify runs of adjacent genes with the same direction Score each gene pair based on intergenic distances Calibrate against KEGG maps Infer associations in other species
    8. 8. Score calibration against a common reference <ul><li>Many diverse types of evidence </li></ul><ul><ul><li>The quality of each is judged by very different raw scores </li></ul></ul><ul><ul><li>Quality differences exist among data sets of the same type </li></ul></ul><ul><li>Solved by calibrating all scores against a common reference </li></ul><ul><ul><li>Scores are directly comparable </li></ul></ul><ul><ul><li>Probabilistic scores allow evidence to be combined </li></ul></ul><ul><li>Requirements for the reference </li></ul><ul><ul><li>Must represent a compromise of the all types of evidence </li></ul></ul><ul><ul><li>Broad species coverage </li></ul></ul>
    9. 9. Integrating physical interaction screens Complex pull-down experiments Yeast two-hybrid data sets are inherently binary Calculate score from number of (co-)occurrences Calculate score from non-shared partners Calibrate against KEGG maps Infer associations in other species Combine evidence from experiments
    10. 10. Mining microarray expression databases Re-normalize arrays by modern method to remove biases Build expression matrix Combine similar arrays by PCA Calculate pairwise linear correlation coefficients Calibrate against KEGG maps Infer associations in other species
    11. 11. Evidence transfer based on “fuzzy orthology” <ul><li>Orthology transfer is tricky </li></ul><ul><ul><li>Correct assignment of orthology is difficult for distant species </li></ul></ul><ul><ul><li>Functional equivalence cannot be guaranteed for in-paralogs </li></ul></ul><ul><li>These problems are addressed by our “fuzzy orthology” scheme </li></ul><ul><ul><li>Confidence scores for functional equivalence are calculated from all-against-all alignment </li></ul></ul><ul><ul><li>Evidence is distributed across possible pairs according to confidence scores in the case of many-to-many relationships </li></ul></ul>? Source species Target species
    12. 12. Multiple evidence types from several species
    13. 13. Getting more specific – generally speaking <ul><li>Benchmarking against one common reference allows integration of heterogeneous data </li></ul><ul><li>The different types of data do not all tell us about the same kind of functional associations </li></ul><ul><li>It should be possible to assign likely interaction types from supporting evidence types </li></ul><ul><li>The aim: to construct an accurate, qualitative models of biological systems or processes </li></ul><ul><li>The models should be accurate even at the level of individual interactions </li></ul><ul><li>This allows specific, testable hypotheses to be made based on high-throughput experimental data </li></ul>
    14. 14. Getting the parts list Yeast culture Microarrays Gene expression Expression profile 600 periodically expressed genes (with associated peak times) that encode “dynamic proteins” The parts list New analysis Cho & Spellman et al.
    15. 15. Constructing a reliable protein network <ul><li>The stickiness of an interaction was scored based on its local network topology </li></ul><ul><li>We benchmarked these scores for each individual data set against a common reference </li></ul><ul><li>Impossible interactions were eliminated based on subcellular localization data </li></ul><ul><li>By restricting the network to a particular system the error rate is further reduced </li></ul>
    16. 16. Extracting a cell cycle interaction network Cell cycle microarray data Physical PPI interactions with confidence scores Expand the set of proteins to include non-periodic proteins that are strongly connected to periodic proteins Raw Data Node selection List of periodically expressed proteins with peak time Interactions Require compatible compartments and high confidence Extract cell cycle network
    17. 17. The temporal interaction network <ul><li>Interacting proteins are expressed close in time </li></ul><ul><li>Two thirds of the dynamic proteins lack interactions but likely participate in transient interactions </li></ul>
    18. 18. <ul><li>Static proteins comprise a third of the interactions at all times of the cell cycle </li></ul><ul><li>Their time of action can be predicted from interactions with dynamic proteins </li></ul>Static proteins play a major role
    19. 19. Cdc28p and its interaction partners
    20. 20. Just-in-time synthesis vs. just-in-time assembly <ul><li>Most dynamic proteins are expressed just before they are needed to carry out their function </li></ul><ul><li>Most complexes also contain static proteins </li></ul><ul><li>Just-in-time assembly of complexes appear to be the general principle </li></ul><ul><li>The time of assembly is controlled synthesizing the last subunits just-in-time </li></ul>
    21. 21. Assembly of the pre-replication complex
    22. 22. Network as a discovery tools <ul><li>The network enables us to place 30+ uncharacterized proteins in a temporal interaction context </li></ul><ul><li>Quite detailed hypotheses can be made concerning the their function </li></ul><ul><li>The network also contains entire novel modules and complexes </li></ul>
    23. 23. Transcription is linked to phosphorylation <ul><li>A genome-wide screen identified 332 Cdc28p targets, which include </li></ul><ul><ul><li>6% of all yeast proteins </li></ul></ul><ul><ul><li>8% of the static proteins </li></ul></ul><ul><ul><li>27% of the dynamic ones </li></ul></ul><ul><li>A similar correlation was observed with predicted PEST regions </li></ul><ul><li>This suggests a hitherto undescribed link between transcriptional and post-translational control </li></ul>
    24. 24. Conclusions <ul><li>Genomic context methods are able to infer the function of many prokaryotic proteins from genome sequences alone </li></ul><ul><li>Integration of large-scale experimental data allows similar predictions to be made for eukaryotic proteins </li></ul><ul><li>Benchmarking is a prerequisite for data integration </li></ul><ul><li>It is possible to construct highly reliable models through careful integration of high-throughput experimental data </li></ul><ul><li>Try STRING at </li></ul>
    25. 25. Acknowledgments <ul><li>The STRING team </li></ul><ul><ul><li>Christian von Mering </li></ul></ul><ul><ul><li>Berend Snel </li></ul></ul><ul><ul><li>Martijn Huynen </li></ul></ul><ul><ul><li>Daniel Jaeggi </li></ul></ul><ul><ul><li>Steffen Schmidt </li></ul></ul><ul><ul><li>Sean Hooper </li></ul></ul><ul><ul><li>Julien Lagarde </li></ul></ul><ul><ul><li>Mathilde Foglierini </li></ul></ul><ul><ul><li>Peer Bork </li></ul></ul><ul><li>New context methods </li></ul><ul><ul><li>Jan Korbel </li></ul></ul><ul><ul><li>Christian von Mering </li></ul></ul><ul><ul><li>Peer Bork </li></ul></ul><ul><li>Cell cycle analysis </li></ul><ul><ul><li>Ulrik de Lichtenberg </li></ul></ul><ul><ul><li>Thomas Skøt Jensen </li></ul></ul><ul><ul><li>Anders Fausbøll </li></ul></ul><ul><ul><li>Søren Brunak </li></ul></ul>
    26. 26. Thank you!