Intracellular Networks
|
|
- Carmella Carter
- 5 years ago
- Views:
Transcription
1 C E N T R E F O R I N T E G R A T I V E B I O I N F O R M A T I C S V U Intracellular Networks (2) Intracellular Network Behaviour Slides on: Networks "The thousands of components of a living cell are dynamically interconnected, so that the cell s functional properties are ultimately encoded into a complex intracellular web [network] of molecular interactions." "This is perhaps most evident with cellular metabolism, a fully connected biochemical network in which hundreds of metabolic substrates are densely integrated through biochemical reactions." (Ravasz E, et al.) TF Ribosomal proteins 1
2 Small-world networks A recent paper, Collective dynamics of "small-world" networks, by Duncan J. Watts and Steven H. Strogatz, which appeared in Nature volume 393, pp (4 June 1998), has attracted considerable attention. One can consider two extremes of networks: The first are regular networks, where "nearby" nodes have large numbers of interconnections, but "distant" nodes have few. The second are random networks, where the nodes are connected at random. Motifs Regular networks are highly clustered, i.e., there is a high density of connections between nearby nodes, but have long path lengths, i.e., to go from one distant node to another one must pass through many intermediate nodes. Random networks are highly un-clustered but have short path lengths. This is because the randomness makes it less likely that nearby nodes will have lots of connections, but introduces more links that connect one part of the network to another. Regular and random networks Regular, small-world and random networks: Rewiring experiments (Watts and Strogatz, 1998) random regular regular complete p is the probability that a randomly chosen connection will be randomly redirected elsewhere (i.e., p=0 means nothing is changed, leaving the network regular; p=1 means every connection is changed and randomly reconnected, yielding complete randomness). For example, for p =.01, (so that only 1% of the edges in the graph have been randomly changed), the "clustering coefficient" is over 95% of what it would be for a regular graph, but the "characteristic path length" is less than 20% of what it would be for a regular graph. Small-world and networks A small-world network can be generated from a regular one by randomly disconnecting a few points and randomly reconnecting them elsewhere. Another way to think of a small world network is that some socalled 'shortcut' links are added to a regular network as shown here: The added links are shortcuts because they allow travel from node (a) to node (b), to occur in only 3 steps, instead of 5 without the shortcuts. Small-world networks Network characterisation: L = characteristic path length C = clustering coefficient A small-world network is much more highly clustered than an equally sparse random graph (C >> Crandom), and its characteristic path length L is close to the theoretical minimum shown by a random graph (L ~ Lrandom). The reason a graph can have small L despite being highly clustered is that a few nodes connecting distant clusters are sufficient to lower L. Because C changes little as small-worldliness develops, it follows that small-worldliness is a global graph property that cannot be found by studying local graph properties. 2
3 Small-world networks A network or order (0<p<1 as in earlier slides) can be characterized by the average shortest length L(p) between any two points, and a clustering coefficient C(p) that measures the cliquishness of a typical neighbourhood (a local property). These can be calculated from mathematical simulations and yield the following behavior (Watts and Strogatz): Small-world networks Part of the reason for the interest in the results of Watts and Strogatz is that smallworld networks seem to be good models for a wide variety of physical situations. They showed that the power grid for the western U.S. (nodes are power stations, and there is an edge joining two nodes if the power stations are joined by highvoltage transmission lines), the neural network of a nematode worm (nodes are neurons and there is an edge joining two nodes if the neurons are joined by a synapse or gap junction), and the Internet Movie Database (nodes are actors and there is an edge joining two nodes if the actors have appeared in the same movie) all have the characteristics (high clustering coefficient but low characteristic path length) of small-world networks. Intuitively, one can see why small-world networks might provide a good model for a number of situations. For example, people tend to form tight clusters of friends and colleagues (a regular network), but then one person might move from New York to Los Angeles, say, introducing a random edge. The results of Watts and Strogatz then provide an explanation for the empirically observed phenomenon that there often seem to be surprisingly short connections between unrelated people (e.g., you meet a complete stranger on an airplane and soon discover that your sister's best friend went to college with his boss's wife). Small world example: metabolism. Wagner and Fell (2001) modeled the known reactions of 287 substrates that represent the central routes of energy metabolism and small-molecule building block synthesis in E. coli. This included metabolic sub-pathways such as: glycolysis pentose phosphate and Entner-Doudoro pathways glycogen metabolism acetate production glyoxalate and anaplerotic reactions tricarboxylic acid cycle oxidative phosphorylation amino acid and polyamine biosynthesis nucleotide and nucleoside biosynthesis folate synthesis and 1-carbon metabolism glycerol 3-phosphate and membrane lipids riboflavin coenzyme A NAD(P) porphyrins, haem and sirohaem lipopolysaccharides and murein pyrophosphate metabolism transport reactions glycerol 3-phosphateproduction isoprenoid biosynthesis and quinone biosynthesis random WagnerA, Fell D (2001) The small world inside large metabolic networks. Proc. R. Soc. London Ser. B 268, These sub-pathways form a network because some compounds are part of more than one pathway and because most of them include common components such as ATP and NADP. The graphs on the left show that considering either reactants or substrates, the clustering coefficient C>>Crandom, and the length coefficient L is near that of Lrandom, characteristics of a small world system. Using a Web crawler, physicist Albert-Laszlo Barabasi and his colleagues at the University of Notre Dame in Indiana in 1998 mapped the connectedness of the Web. They were surprised to find that the structure of the Web didn't conform to the then-accepted model of random connectivity. Instead, their experiment yielded a connectivity map that they christened "scale-free." In any real network some nodes are more highly connected than others. P(k) is the proportion of nodes that have k-links. For large, random graphs only a few nodes have a very small k and only a few have a very large k, leading to a bell-shaped Poisson distribution: Often small-world networks are also scale-free. In a scale-free network the characteristic clustering is maintained even as the networks themselves grow arbitrarily large. Scale-free networks fall off more slowly and are more highly skewed than random ones due to the combination of small-world local highly connected neighborhoods and more 'shortcuts' than would be expected by chance. Scale-free networks are governed by a power law of the form: P(k) ~ k -γ 3
4 Because of the P(k) ~ k -γ power law relationship, a log-log plot of P(k) versus k gives a straight line of slope -γ : Some networks, especially smallworld networks of modest size do not follow a power law, but are exponential. This point can be significant when trying to understand the rules that underlie the network. Hierarchical networks C(k) ~ k 1 a straight line of slope l on a log log plot (see figure, part Cc). A hierarchical architecture implies that sparsely connected nodes are part of highly clustered areas, with communication between the different highly clustered neighbourhoods being maintained by a few hubs Hierarchical networks Iterative construction leading to a hierarchical network. Starting from a fully connected cluster of five nodes shown in (a) (note that the diagonal nodes are also connected links not visible), we create four identical replicas, connecting the peripheral nodes of each cluster to the central node of the original cluster, obtaining a network of N=25 nodes (b). In the next step, we create four replicas of the obtained cluster, and connect the peripheral nodes again, as shown in (c), to the central node of the original module, obtaining a N=125-node network. This process can be continued indefinitely. Comparing Random and Scale-Free Distribution In the random network (right), the five nodes with the most links (in red) are connected to only 27% of all nodes (green). In the scale-free network (left), the five most connected nodes (red), often called hubs, are connected to 60% of all nodes (green). Before discovering scale-free networks, Barabasi and his team had been doing work that modeled surfaces in terms of fractals, which are also scale-free. Their discoveries about networks have been found to have implications well beyond the Internet; the notion of scale-free networks has turned the study of a number of fields upside down. Scale-free networks have been used to explain behaviors as diverse as those of power grids, the stock market and cancerous cells, as well as the dispersal of sexually transmitted diseases. Put simply, the nodes of a scale-free network aren't randomly or evenly connected. Scale-free networks include many "very connected" nodes, hubs of connectivity that shape the way the network operates. The ratio of very connected nodes to the number of nodes in the rest of the network remains constant as the network changes in size. In contrast, random connectivity distributions the kinds of models used to study networks like the Internet before Barabasi and his team made their observation predicted that there would be no well-connected nodes, or that there would be so few that they would be statistically insignificant. Although not all nodes in that kind of network would be connected to the same degree, most would have a number of connections hovering around a small, average value. Also, as a randomly distributed network grows, the relative number of very connected nodes decreases. 4
5 The ramifications of this difference between the two types of networks are significant, but it's worth pointing out that both scale-free and randomly distributed networks can be what are called "small world" networks. That means it doesn't take many hops to get from one node to another the science behind the notion that there are only six degrees of separation between any two people in the world. So, in both scale-free and randomly distributed networks, with or without very connected nodes, it may not take many hops for a node to make a connection with another node. There's a good chance, though, that in a scale-free network, many transactions would be funneled through one of the well-connected hub nodes - one like Google s Web portal. Because of these differences, the two types of networks behave differently as they break down. The connectedness of a randomly distributed network decays steadily as nodes fail, slowly breaking into smaller, separate domains that are unable to communicate. Resists Random Failure Scale-free networks, on the other hand, may show almost no degradation as random nodes fail. With their very connected nodes, which are statistically unlikely to fail under random conditions, connectivity in the network is maintained. It takes quite a lot of random failure before the hubs are wiped out, and only then does the network stop working. (Of course, there's always the possibility that the very connected nodes would be the first to go.) In a targeted attack, in which failures aren't random but are the result of mischief, or worse, directed at hubs, the scale-free network fails catastrophically. Take out the very connected nodes, and the whole network stops functioning. In these days of concern about cyber attacks on the critical infrastructure, whether the nodes on the network in question are randomly distributed or are scale-free makes a big difference. Epidemiologists are also pondering the significance of scale-free connectivity. Until now, it has been accepted that stopping sexually transmitted diseases requires reaching or immunizing a large proportion of the population; most contacts will be safe, and the disease will no longer spread. But if societies of people include the very connected individuals of scale-free networks individuals who have sex lives that are quantitatively different from those of their peers then health offensives will fail unless they target these individuals. These individuals will propagate the disease no matter how many of their more subdued neighbors are immunized. Now consider the following: Geographic connectivity of Internet nodes is scale-free, the number of links on Web pages is scale-free, Web users belong to interest groups that are connected in a scale-free way, and s propagate in a scale-free way. Barabasi's model of the Internet tells us that stopping a computer virus from spreading requires that we focus on protecting the hubs. Scale Free Network Hubs, highly connected nodes, bring together different parts of the network Rubustness: Removing random nodes has little effect Low attack resistance: Removing a hub is lethal (PPI: centrality-lethality rule, see later). Random Network No hubs Low robustness Low attack resistance 5
6 subtypes (paralogs) Schematic representation of co-immunoprecipitation studies performed with anti- MARK (microtubule affinity-regulating kinase) antibodies. The strength of the interactions is indicated by the thickness of the arrows (after (2). connect preferentially to a hub Preferential attachment Hub protein characteristics: Multiple binding sites Promiscuous binding Non-specific binding connect preferentially to a hub Hub proteins in yeast Genome-wide studies show that deletion of a hub protein is more likely to be lethal than deletion of a non-hub protein, a phenomenon known as the centrality-lethality rule. [..] network analysis suggests that the centrality-lethality rule is unrelated to the network architecture, but is explained by the simple fact that hubs have large numbers of PPIs, therefore high probabilities of engaging in essential PPIs He X, Zhang J (2006) Why do hubs tend to be essential in protein networks? PLoS Genet 2(6):e88 Network motifs Network motifs Types of feed-forward loops Transcription regulation networks control the expression of genes. The transcription networks of well-studied microorganisms appear to be made up of a small set of recurring regulation patterns, called network motifs. The same network motifs have recently been found in diverse organisms from bacteria to humans, suggesting that they serve as basic building blocks of transcription networks. Uri Alon, Nature 8, ;
7 Network motifs Different Motifs in different processes More interconnected motifs are more conserved Network Dynamics Party hubs: always the same partners (same time and space) Date hubs: different partners in different conditions (different time and/or space) Difference is important for inter-process communication Network Dynamics Party hubs: always the same partners (same time and space) Multiple small binding surfaces Date hubs: different partners in different conditions (different time and/or space) A single (or perhaps a few) large (and less specific) binding surfaces s Date hubs: large binding surfaces / Party hubs: small binding surfaces Need to create new binding interfaces 7
8 A network example from Meta-genomics Ecogenomics soil ecosystems A virtual network where species are nodes and (groups of) chemical compounds are exchanged between the nodes Preferential attachment in biodegradation networks New degradable compounds are observed to attach preferentially to hubs close to (or in) the Central Metabolism Valencia and co-workers The Matchmaker family Massively interacting protein family (the PPI champions) by means of various binding modes Involved in many essential cell processes Occurs throughout kingdom of life Various numbers of isoforms in different organisms (7 in human) dimer structure 8
9 network (hub?) promotion by binding and bringing together two different proteins Janus-faced character of s Identified (co)-targets fall in opposing classes. Clear color: actin growth, proapoptotic, stimulation of transcription, nuclear import, neuron development. Hatched: opposing functions. 100% = 56 proteins (De Boer & Jimenez, unpubl. data.). Targets of proteins implicated in tumor development. Arrows indicate positive effects while sticks represent inhibitory effects. Targets involved in primary apoptosis and cell cycle control are not shown due to space limitations. Role of proteins in apoptosis proteins inhibit apoptosis through multiple mechanisms: sequestration and control of subcellular localization of phosphorylated and nonphosphorylated pro- and anti-apoptotic proteins. What is the role of the subtypes? Modularity? subtypes (paralogs) Different subtypes display different binding modes, reflecting pronounced divergent evolution after duplication Schematic representation of co-immunoprecipitation studies performed with anti- MARK (microtubule affinity-regulating kinase) antibodies. The strength of the interactions is indicated by the thickness of the arrows subtypes ζ,β,γ and η Phylogenetic profile analysis n Function prediction of genes based on guilt-byassociation a non-homologous approach n The phylogenetic profile of a protein is a string that encodes the presence or absence of the protein in every sequenced genome n Because proteins that participate in a common structural complex or metabolic pathway are likely to co-evolve, the phylogenetic profiles of such proteins are often ``similar'' 9
10 Phylogenetic profile analysis Phylogenetic profile analysis Evolution suppresses unnecessary proteins Once a member of an interaction is lost, the partner is likely to be lost as well n Phylogenetic profile (against N genomes) For each gene X in a target genome (e.g., E coli), build a phylogenetic profile as follows If gene X has a homolog in genome #i, the i th bit of X s phylogenetic profile is 1, otherwise it is 0 gene Phylogenetic profile analysis n Example phylogenetic profiles based on 60 genomes genome orf1034: orf1036: orf1037: orf1038: orf1039: orf104: orf1040: orf1041: orf1042: orf1043: orf1044: orf1045: orf1046: orf1047: orf105: orf1054: By correlating the rows (open reading frames (ORF) or genes) you find out about joint presence or absence of genes: this is a signal for a functional connection Genes with similar phylogenetic profiles have related functions or functionally linked D Eisenberg and colleagues (1999) Phylogenetic profile analysis n Phylogenetic profiles contain great amount of functional information n Phlylogenetic profile analysis can be used to distinguish orthologous genes from paralogous genes n Subcellular localization: 361 yeast nucleus-encoded mitochondrial proteins are identified at 50% accuracy with 58% coverage through phylogenetic profile analysis n Functional complementarity: By examining inverse phylogenetic profiles, one can find functionally complementary genes that have evolved through one of several mechanisms of convergent evolution. Prediction of protein-protein interactions Rosetta stone n Gene fusion is the an effective method for prediction of protein-protein interactions If proteins A and B are homologous to two domains of a protein C, A and B are predicted to have interaction A Though gene-fusion has low prediction coverage, it false-positive rate is low (high specificity) B C Two-domain protein Gene (domain) fusion example n Vertebrates have a multi-enzyme protein (GARs- AIRs-GARt) comprising the enzymes GAR synthetase (GARs), AIR synthetase (AIRs), and GAR transformylase (GARt). n In insects, the polypeptide appears as GARs- (AIRs) 2 -GARt. n In yeast, GARs-AIRs is encoded separately from GARt n In bacteria each domain is encoded separately (Henikoff et al., 1997). GAR: glycinamide ribonucleotide AIR: aminoimidazole ribonucleotide 10
11 Protein interaction prediction through coevolution Protein interaction database n There are numerous databases of protein-protein interactions n DIP is a popular protein-protein interaction database FALSE NEGATIVES: need many organisms relies on known orthologous relationships FALSE POSITIVES Phylogenetic signals at the organismal level Functional interaction may not mean physical interaction The DIP database catalogs experimentally determined interactions between proteins. It combines information from a variety of sources to create a single, consistent set of protein-protein interactions. Protein interaction databases Protein interaction database BIND - Biomolecular Interaction Network Database DIP - Database of Interacting Proteins PIM Hybrigenics PathCalling Yeast Interaction Database MINT - a Molecular Interactions Database GRID - The General Repository for Interaction Datasets InterPreTS - protein interaction prediction through tertiary structure STRING - predicted functional associations among genes/proteins Mammalian protein-protein interaction database (PPI) InterDom - database of putative interacting protein domains FusionDB - database of bacterial and archaeal gene fusion events IntAct Project The Human Protein Interaction Database (HPID) ADVICE - Automated Detection and Validation of Interaction by Co-evolution InterWeaver - protein interaction reports with online evidence PathBLAST - alignment of protein interaction networks ClusPro - a fully automated algorithm for protein-protein docking HPRD - Human Protein Reference Database Network of protein interactions and predicted functional links involving silencing information regulator (SIR) proteins. Filled circles represent proteins of known function; open circles represent proteins of unknown function, represented only by their Saccharomyces genome sequence numbers ( Solid lines show experimentally determined interactions, as summarized in the Database of Interacting Proteins 19 ( Dashed lines show functional links predicted by the Rosetta Stone method 12. Dotted lines show functional links predicted by phylogenetic profiles 16. Some predicted links are omitted for clarity. Network of predicted functional linkages involving the yeast prion protein 20 Sup35. The dashed line shows the only experimentally determined interaction. The other functional links were calculated from genome and expression data 11 by a combination of methods, including phylogenetic profiles, Rosetta stone linkages and mrna expression. Linkages predicted by more than one method, and hence particularly reliable, are shown by heavy lines. Adapted from ref
12 STRING - predicted functional associations among genes/proteins n STRING is a database of predicted functional associations among genes/proteins. n Genes of similar function tend to be maintained in close neighborhood, tend to be present or absent together, i.e. to have the same phylogenetic occurrence, and can sometimes be found fused into a single gene encoding a combined polypeptide. n STRING integrates this information from as many genomes as possible to predict functional links between proteins. Berend Snel en Martijn Huynen (RUN) and the group of Peer Bork (EMBL, Heidelberg) STRING - predicted functional associations among genes/proteins STRING is a database of known and predicted proteinprotein interactions. The interactions include direct (physical) and indirect (functional) associations; they are derived from four sources: 1. Genomic Context (Synteny) 2. High-throughput Experiments 3. (Conserved) Co-expression 4. Previous Knowledge STRING quantitatively integrates interaction data from these sources for a large number of organisms, and transfers information between these organisms where applicable. The database currently contains proteins in 179 species STRING - predicted functional associations among genes/proteins Conserved Neighborhood STRING - predicted functional associations among genes/proteins Gene clusters in a genomic region are likely to interact co-ordinated expression This view shows runs of genes that occur repeatedly in close neighborhood in (prokaryotic) genomes. Genes located together in a run are linked with a black line (maximum allowed intergenic distance is 300 bp). Note that if there are multiple runs for a given species, these are separated by white space. If there are other genes in the run that are below the current score threshold, they are drawn as small white triangles. Gene fusion occurences are also drawn, but only if they are present in a run. co-ordinated gene gains/losses Functional inference at systems level Functional inference at systems level n Function prediction of individual genes could be made in the context of biological pathways/networks n KEGG is database of biological pathways and networks n Example phob is predicted to be a transcription regulator and it regulates all the genes in the pho-regulon (a group of coregulated operons); and within this regulon, gene A is interacting with gene B, etc. phob 12
13 Functional inference at systems level Functional inference at systems level Consequence of evolution n Notion of comparative analysis (Darwin) n What you know about one species might be transferable to another, for example from mouse to human n Provides a framework to do multi-level large-scale analysis of the genomics data plethora Functional inference at systems level n By doing homologous search, one can map a known biological pathway in one organism to another one; hence predict gene functions in the context of biological pathways/networks n Mapping networks of multiple organisms and looking at the evolutionary conservation allows the delineation of modules and essential parts of the networks Network Evolution The citric-acid cycle Human Yeast This pathway diagram shows a comparison of pathways in (left) Homo sapiens (human) and (right) Saccharomyces cerevisiae (baker s yeast). Changes in controlling enzymes (square boxes in red) and the pathway itself have occurred (yeast has one altered ( overtaking ) path in the graph) 13
14 The citric-acid cycle The citric-acid cycle M. A. Huynen, T. Dandekar and P. Bork ``Variation and evolution of the citric acid cycle: a genomic approach'' Trends Microbiol, 7, (1999) Fig. 1. (a) A graphical representation of the reactions of the citric-acid cycle (CAC), including the connections with pyruvate and phosphoenolpyruvate, and the glyoxylate shunt. When there are two enzymes that are not homologous to each other but that catalyse the same reaction (nonhomologous gene displacement), one is marked with a solid line and the other with a dashed line. The oxidative direction is clockwise. The enzymes with their EC numbers are as follows: 1, citrate synthase ( ); 2, aconitase ( ); 3, isocitrate dehydrogenase ( ); 4, 2-ketoglutarate dehydrogenase (solid line; and ) and 2- ketoglutarate ferredoxin oxidoreductase (dashed line; ); 5, succinyl- CoA synthetase (solid line; ) or succinyl-coa acetoacetate-coa transferase (dashed line; ); 6, succinate dehydrogenase or fumarate reductase ( ); 7, fumarase ( ) class I (dashed line) and class II (solid line); 8, bacterial-type malate dehydrogenase (solid line) or archaeal-type malate dehydrogenase (dashed line) ( ); 9, isocitrate lyase ( ); 10, malate synthase ( ); 11, phosphoenolpyruvate carboxykinase ( ) or phosphoenolpyruvate carboxylase ( ); 12, malic enzyme ( or ); 13, pyruvate carboxylase or oxaloacetate decarboxylase ( ); 14, pyruvate dehydrogenase (solid line; and ) and pyruvate ferredoxin oxidoreductase (dashed line; ). b) Individual species might not have a complete CAC. This diagram shows the genes for the CAC for each unicellular species for which a genome sequence has been published, together with the phylogeny of the species. The distance-based phylogeny was constructed using the fraction of genes shared between genomes as a similarity criterion. The major kingdoms of life are indicated in red (Archaea), blue (Bacteria) and yellow (Eukarya). Question marks represent reactions for which there is biochemical evidence in the species itself or in a related species but for which no genes could be found. Genes that lie in a single operon are shown in the same color. Genes were assumed to be located in a single operon when they were transcribed in the same direction and the stretches of non-coding DNA separating them were less than 50 nucleotides in length. M. A. Huynen, T. Dandekar and P. Bork ``Variation and evolution of the citric acid cycle: a genomic approach'' Trends Microbiol, 7, (1999) Wrapping up n Prim s algorithm for MST and derived clustering protocol n Regular, random, small-world and scale-free networks n Evolution of topology and dynamics of biological networks, e.g. duplication, preferential attachment, party/date hub proteins,.. n We have seen a number of ways to infer a putative function for a protein sequence (e.g. guilt by association): PPI prediction is a special case and you should know the related methods n Phylogenetic signal to predict PPI (co-evolution) n To gain confidence, it is important to combine as many different prediction protocols as possible (the STRING server is an example of this) n Comparing and overlaying various networks (e.g. regulation, signalling, metabolic, PPI) and studying conservation at these network levels is one of the current grand challenges, and will be crucially important for a systems based approach to (intra)cellular behaviour. 14
CSCE555 Bioinformatics. Protein Function Annotation
CSCE555 Bioinformatics Protein Function Annotation Why we need to do function annotation? Fig from: Network-based prediction of protein function. Molecular Systems Biology 3:88. 2007 What s function? The
More informationProtein domains, function and associated prediction. Experimental. Protein function categories. Issue when elucidating function experimentally
C E T R E F O R I T E G R A T I V E B I O I F O R M A T I C S V U Lecture 14: Protein domains, function and associated prediction Introduction to Bioinformatics Metabolomics fluxomics Functional Genomics
More informationComputational approaches for functional genomics
Computational approaches for functional genomics Kalin Vetsigian October 31, 2001 The rapidly increasing number of completely sequenced genomes have stimulated the development of new methods for finding
More informationnetworks in molecular biology Wolfgang Huber
networks in molecular biology Wolfgang Huber networks in molecular biology Regulatory networks: components = gene products interactions = regulation of transcription, translation, phosphorylation... Metabolic
More informationTypes of biological networks. I. Intra-cellurar networks
Types of biological networks I. Intra-cellurar networks 1 Some intra-cellular networks: 1. Metabolic networks 2. Transcriptional regulation networks 3. Cell signalling networks 4. Protein-protein interaction
More informationNetwork Biology: Understanding the cell s functional organization. Albert-László Barabási Zoltán N. Oltvai
Network Biology: Understanding the cell s functional organization Albert-László Barabási Zoltán N. Oltvai Outline: Evolutionary origin of scale-free networks Motifs, modules and hierarchical networks Network
More informationBioinformatics 2. Yeast two hybrid. Proteomics. Proteomics
GENOME Bioinformatics 2 Proteomics protein-gene PROTEOME protein-protein METABOLISM Slide from http://www.nd.edu/~networks/ Citrate Cycle Bio-chemical reactions What is it? Proteomics Reveal protein Protein
More informationWritten Exam 15 December Course name: Introduction to Systems Biology Course no
Technical University of Denmark Written Exam 15 December 2008 Course name: Introduction to Systems Biology Course no. 27041 Aids allowed: Open book exam Provide your answers and calculations on separate
More informationSYSTEMS BIOLOGY 1: NETWORKS
SYSTEMS BIOLOGY 1: NETWORKS SYSTEMS BIOLOGY Starting around 2000 a number of biologists started adopting the term systems biology for an approach to biology that emphasized the systems-character of biology:
More informationErzsébet Ravasz Advisor: Albert-László Barabási
Hierarchical Networks Erzsébet Ravasz Advisor: Albert-László Barabási Introduction to networks How to model complex networks? Clustering and hierarchy Hierarchical organization of cellular metabolism The
More informationComputational methods for predicting protein-protein interactions
Computational methods for predicting protein-protein interactions Tomi Peltola T-61.6070 Special course in bioinformatics I 3.4.2008 Outline Biological background Protein-protein interactions Computational
More informationSelf Similar (Scale Free, Power Law) Networks (I)
Self Similar (Scale Free, Power Law) Networks (I) E6083: lecture 4 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA {predrag}@ee.columbia.edu February 7, 2007
More informationProteomics. Yeast two hybrid. Proteomics - PAGE techniques. Data obtained. What is it?
Proteomics What is it? Reveal protein interactions Protein profiling in a sample Yeast two hybrid screening High throughput 2D PAGE Automatic analysis of 2D Page Yeast two hybrid Use two mating strains
More informationBiological Networks: Comparison, Conservation, and Evolution via Relative Description Length By: Tamir Tuller & Benny Chor
Biological Networks:,, and via Relative Description Length By: Tamir Tuller & Benny Chor Presented by: Noga Grebla Content of the presentation Presenting the goals of the research Reviewing basic terms
More informationBiological networks CS449 BIOINFORMATICS
CS449 BIOINFORMATICS Biological networks Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the Universe trying to produce bigger and better
More informationBiological Networks. Gavin Conant 163B ASRC
Biological Networks Gavin Conant 163B ASRC conantg@missouri.edu 882-2931 Types of Network Regulatory Protein-interaction Metabolic Signaling Co-expressing General principle Relationship between genes Gene/protein/enzyme
More informationSubsystem: TCA Cycle. List of Functional roles. Olga Vassieva 1 and Rick Stevens 2 1. FIG, 2 Argonne National Laboratory and University of Chicago
Subsystem: TCA Cycle Olga Vassieva 1 and Rick Stevens 2 1 FIG, 2 Argonne National Laboratory and University of Chicago List of Functional roles Tricarboxylic acid cycle (TCA) oxidizes acetyl-coa to CO
More informationLecture 4: Yeast as a model organism for functional and evolutionary genomics. Part II
Lecture 4: Yeast as a model organism for functional and evolutionary genomics Part II A brief review What have we discussed: Yeast genome in a glance Gene expression can tell us about yeast functions Transcriptional
More informationLecture 8: Temporal programs and the global structure of transcription networks. Chap 5 of Alon. 5.1 Introduction
Lecture 8: Temporal programs and the global structure of transcription networks Chap 5 of Alon 5. Introduction We will see in this chapter that sensory transcription networks are largely made of just four
More informationComplex (Biological) Networks
Complex (Biological) Networks Today: Measuring Network Topology Thursday: Analyzing Metabolic Networks Elhanan Borenstein Some slides are based on slides from courses given by Roded Sharan and Tomer Shlomi
More informationInteraction Network Analysis
CSI/BIF 5330 Interaction etwork Analsis Young-Rae Cho Associate Professor Department of Computer Science Balor Universit Biological etworks Definition Maps of biochemical reactions, interactions, regulations
More informationThe architecture of complexity: the structure and dynamics of complex networks.
SMR.1656-36 School and Workshop on Structure and Function of Complex Networks 16-28 May 2005 ------------------------------------------------------------------------------------------------------------------------
More informationINTERACTIVE CLUSTERING FOR EXPLORATION OF GENOMIC DATA
INTERACTIVE CLUSTERING FOR EXPLORATION OF GENOMIC DATA XIUFENG WAN xw6@cs.msstate.edu Department of Computer Science Box 9637 JOHN A. BOYLE jab@ra.msstate.edu Department of Biochemistry and Molecular Biology
More informationAnalysis of Biological Networks: Network Robustness and Evolution
Analysis of Biological Networks: Network Robustness and Evolution Lecturer: Roded Sharan Scribers: Sasha Medvedovsky and Eitan Hirsh Lecture 14, February 2, 2006 1 Introduction The chapter is divided into
More informationBiological Networks Analysis
Biological Networks Analysis Degree Distribution and Network Motifs Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein Networks: Networks vs. graphs A collection of nodesand
More informationGraph Theory Approaches to Protein Interaction Data Analysis
Graph Theory Approaches to Protein Interaction Data Analysis Nataša Pržulj September 8, 2003 Contents 1 Introduction 2 1.1 Graph Theoretic Terminology................................. 3 1.2 Biological
More informationBioControl - Week 6, Lecture 1
BioControl - Week 6, Lecture 1 Goals of this lecture Large metabolic networks organization Design principles for small genetic modules - Rules based on gene demand - Rules based on error minimization Suggested
More informationL3.1: Circuits: Introduction to Transcription Networks. Cellular Design Principles Prof. Jenna Rickus
L3.1: Circuits: Introduction to Transcription Networks Cellular Design Principles Prof. Jenna Rickus In this lecture Cognitive problem of the Cell Introduce transcription networks Key processing network
More informationV19 Metabolic Networks - Overview
V19 Metabolic Networks - Overview There exist different levels of computational methods for describing metabolic networks: - stoichiometry/kinetics of classical biochemical pathways (glycolysis, TCA cycle,...
More informationComplex (Biological) Networks
Complex (Biological) Networks Today: Measuring Network Topology Thursday: Analyzing Metabolic Networks Elhanan Borenstein Some slides are based on slides from courses given by Roded Sharan and Tomer Shlomi
More informationV14 extreme pathways
V14 extreme pathways A torch is directed at an open door and shines into a dark room... What area is lighted? Instead of marking all lighted points individually, it would be sufficient to characterize
More informationBiological Pathways Representation by Petri Nets and extension
Biological Pathways Representation by and extensions December 6, 2006 Biological Pathways Representation by and extension 1 The cell Pathways 2 Definitions 3 4 Biological Pathways Representation by and
More informationGraph Alignment and Biological Networks
Graph Alignment and Biological Networks Johannes Berg http://www.uni-koeln.de/ berg Institute for Theoretical Physics University of Cologne Germany p.1/12 Networks in molecular biology New large-scale
More informationNETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION
NETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION Albert-László Barabási* & Zoltán N. Oltvai A key aim of postgenomic biomedical research is to systematically catalogue all molecules and
More informationName: SBI 4U. Gene Expression Quiz. Overall Expectation:
Gene Expression Quiz Overall Expectation: - Demonstrate an understanding of concepts related to molecular genetics, and how genetic modification is applied in industry and agriculture Specific Expectation(s):
More informationSystems biology and biological networks
Systems Biology Workshop Systems biology and biological networks Center for Biological Sequence Analysis Networks in electronics Radio kindly provided by Lazebnik, Cancer Cell, 2002 Systems Biology Workshop,
More informationGenome Annotation. Bioinformatics and Computational Biology. Genome sequencing Assembly. Gene prediction. Protein targeting.
Genome Annotation Bioinformatics and Computational Biology Genome Annotation Frank Oliver Glöckner 1 Genome Analysis Roadmap Genome sequencing Assembly Gene prediction Protein targeting trna prediction
More informationSupplementary Information
Supplementary Information For the article"comparable system-level organization of Archaea and ukaryotes" by J. Podani, Z. N. Oltvai, H. Jeong, B. Tombor, A.-L. Barabási, and. Szathmáry (reference numbers
More information2 Genome evolution: gene fusion versus gene fission
2 Genome evolution: gene fusion versus gene fission Berend Snel, Peer Bork and Martijn A. Huynen Trends in Genetics 16 (2000) 9-11 13 Chapter 2 Introduction With the advent of complete genome sequencing,
More informationIntroduction. Gene expression is the combined process of :
1 To know and explain: Regulation of Bacterial Gene Expression Constitutive ( house keeping) vs. Controllable genes OPERON structure and its role in gene regulation Regulation of Eukaryotic Gene Expression
More informationGraph Theory and Networks in Biology
Graph Theory and Networks in Biology Oliver Mason and Mark Verwoerd Hamilton Institute, National University of Ireland Maynooth, Co. Kildare, Ireland {oliver.mason, mark.verwoerd}@nuim.ie January 17, 2007
More informationBMD645. Integration of Omics
BMD645 Integration of Omics Shu-Jen Chen, Chang Gung University Dec. 11, 2009 1 Traditional Biology vs. Systems Biology Traditional biology : Single genes or proteins Systems biology: Simultaneously study
More information6.207/14.15: Networks Lecture 12: Generalized Random Graphs
6.207/14.15: Networks Lecture 12: Generalized Random Graphs 1 Outline Small-world model Growing random networks Power-law degree distributions: Rich-Get-Richer effects Models: Uniform attachment model
More informationUNIT 6 PART 3 *REGULATION USING OPERONS* Hillis Textbook, CH 11
UNIT 6 PART 3 *REGULATION USING OPERONS* Hillis Textbook, CH 11 REVIEW: Signals that Start and Stop Transcription and Translation BUT, HOW DO CELLS CONTROL WHICH GENES ARE EXPRESSED AND WHEN? First of
More informationHonors Biology Reading Guide Chapter 11
Honors Biology Reading Guide Chapter 11 v Promoter a specific nucleotide sequence in DNA located near the start of a gene that is the binding site for RNA polymerase and the place where transcription begins
More informationProtein-protein interaction networks Prof. Peter Csermely
Protein-Protein Interaction Networks 1 Department of Medical Chemistry Semmelweis University, Budapest, Hungary www.linkgroup.hu csermely@eok.sote.hu Advantages of multi-disciplinarity Networks have general
More informationEnergy and Cellular Metabolism
1 Chapter 4 About This Chapter Energy and Cellular Metabolism 2 Energy in biological systems Chemical reactions Enzymes Metabolism Figure 4.1 Energy transfer in the environment Table 4.1 Properties of
More information56:198:582 Biological Networks Lecture 10
56:198:582 Biological Networks Lecture 10 Temporal Programs and the Global Structure The single-input module (SIM) network motif The network motifs we have studied so far all had a defined number of nodes.
More informationBio 1B Lecture Outline (please print and bring along) Fall, 2007
Bio 1B Lecture Outline (please print and bring along) Fall, 2007 B.D. Mishler, Dept. of Integrative Biology 2-6810, bmishler@berkeley.edu Evolution lecture #5 -- Molecular genetics and molecular evolution
More information# shared OGs (spa, spb) Size of the smallest genome. dist (spa, spb) = 1. Neighbor joining. OG1 OG2 OG3 OG4 sp sp sp
Bioinformatics and Evolutionary Genomics: Genome Evolution in terms of Gene Content 3/10/2014 1 Gene Content Evolution What about HGT / genome sizes? Genome trees based on gene content: shared genes Haemophilus
More informationIt s a Small World After All
It s a Small World After All Engage: Cities, factories, even your own home is a network of dependent and independent parts that make the whole function properly. Think of another network that has subunits
More informationQuiz answers. Allele. BIO 5099: Molecular Biology for Computer Scientists (et al) Lecture 17: The Quiz (and back to Eukaryotic DNA)
BIO 5099: Molecular Biology for Computer Scientists (et al) Lecture 17: The Quiz (and back to Eukaryotic DNA) http://compbio.uchsc.edu/hunter/bio5099 Larry.Hunter@uchsc.edu Quiz answers Kinase: An enzyme
More informationProkaryotic Regulation
Prokaryotic Regulation Control of transcription initiation can be: Positive control increases transcription when activators bind DNA Negative control reduces transcription when repressors bind to DNA regulatory
More informationIntroduction to Bioinformatics Integrated Science, 11/9/05
1 Introduction to Bioinformatics Integrated Science, 11/9/05 Morris Levy Biological Sciences Research: Evolutionary Ecology, Plant- Fungal Pathogen Interactions Coordinator: BIOL 495S/CS490B/STAT490B Introduction
More informationLecture Series 9 Cellular Pathways That Harvest Chemical Energy
Lecture Series 9 Cellular Pathways That Harvest Chemical Energy Reading Assignments Review Chapter 3 Energy, Catalysis, & Biosynthesis Read Chapter 13 How Cells obtain Energy from Food Read Chapter 14
More informationnumber Done by Corrected by Doctor Nafeth Abu Tarboush
number 6 Done by أنس القيشاوي Corrected by Zaid Emad Doctor Nafeth Abu Tarboush 1 P a g e In the previous lecture, we talked about redox reactions and the reduction potential briefly and how it can help
More information3.B.1 Gene Regulation. Gene regulation results in differential gene expression, leading to cell specialization.
3.B.1 Gene Regulation Gene regulation results in differential gene expression, leading to cell specialization. We will focus on gene regulation in prokaryotes first. Gene regulation accounts for some of
More informationFrom gene to protein. Premedical biology
From gene to protein Premedical biology Central dogma of Biology, Molecular Biology, Genetics transcription replication reverse transcription translation DNA RNA Protein RNA chemically similar to DNA,
More informationChapter 8: The Topology of Biological Networks. Overview
Chapter 8: The Topology of Biological Networks 8.1 Introduction & survey of network topology Prof. Yechiam Yemini (YY) Computer Science Department Columbia University A gallery of networks Small-world
More information1.9 Practice Problems
1.9 Practice Problems 1. Solution: B It s not only chlorophyll a but a combination of pigments. 2. Solution: D See at what wavelength rate of photosynthesis is the highest. 3. Solution: D It s a fact.
More informationSara Khraim. Shaymaa Alnamos ... Dr. Nafeth
10 Sara Khraim Shaymaa Alnamos... Dr. Nafeth *Requirement of oxidative phosphorylation: 1- Source and target for electrons(nadh+fadh2 >> O2). 2- Electron carriers. 3- Enzymes, like oxidoreductases and
More information2. In regards to the fluid mosaic model, which of the following is TRUE?
General Biology: Exam I Sample Questions 1. How many electrons are required to fill the valence shell of a neutral atom with an atomic number of 24? a. 0 the atom is inert b. 1 c. 2 d. 4 e. 6 2. In regards
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000
Topology of evolving networks: local events and universality arxiv:cond-mat/0005085v1 [cond-mat.dis-nn] 4 May 2000 Réka Albert and Albert-László Barabási Department of Physics, University of Notre-Dame,
More informationIntegration of functional genomics data
Integration of functional genomics data Laboratoire Bordelais de Recherche en Informatique (UMR) Centre de Bioinformatique de Bordeaux (Plateforme) Rennes Oct. 2006 1 Observations and motivations Genomics
More informationMETHODS FOR DETERMINING PHYLOGENY. In Chapter 11, we discovered that classifying organisms into groups was, and still is, a difficult task.
Chapter 12 (Strikberger) Molecular Phylogenies and Evolution METHODS FOR DETERMINING PHYLOGENY In Chapter 11, we discovered that classifying organisms into groups was, and still is, a difficult task. Modern
More informationOrganization of Genes Differs in Prokaryotic and Eukaryotic DNA Chapter 10 p
Organization of Genes Differs in Prokaryotic and Eukaryotic DNA Chapter 10 p.110-114 Arrangement of information in DNA----- requirements for RNA Common arrangement of protein-coding genes in prokaryotes=
More informationChapter 15 Active Reading Guide Regulation of Gene Expression
Name: AP Biology Mr. Croft Chapter 15 Active Reading Guide Regulation of Gene Expression The overview for Chapter 15 introduces the idea that while all cells of an organism have all genes in the genome,
More informationLecture 6: The feed-forward loop (FFL) network motif
Lecture 6: The feed-forward loop (FFL) network motif Chapter 4 of Alon x 4. Introduction x z y z y Feed-forward loop (FFL) a= 3-node feedback loop (3Loop) a=3 Fig 4.a The feed-forward loop (FFL) and the
More informationName Period The Control of Gene Expression in Prokaryotes Notes
Bacterial DNA contains genes that encode for many different proteins (enzymes) so that many processes have the ability to occur -not all processes are carried out at any one time -what allows expression
More informationMETABOLIC PATHWAY PREDICTION/ALIGNMENT
COMPUTATIONAL SYSTEMIC BIOLOGY METABOLIC PATHWAY PREDICTION/ALIGNMENT Hofestaedt R*, Chen M Bioinformatics / Medical Informatics, Technische Fakultaet, Universitaet Bielefeld Postfach 10 01 31, D-33501
More informationGenomics and bioinformatics summary. Finding genes -- computer searches
Genomics and bioinformatics summary 1. Gene finding: computer searches, cdnas, ESTs, 2. Microarrays 3. Use BLAST to find homologous sequences 4. Multiple sequence alignments (MSAs) 5. Trees quantify sequence
More informationGraph Theory and Networks in Biology arxiv:q-bio/ v1 [q-bio.mn] 6 Apr 2006
Graph Theory and Networks in Biology arxiv:q-bio/0604006v1 [q-bio.mn] 6 Apr 2006 Oliver Mason and Mark Verwoerd February 4, 2008 Abstract In this paper, we present a survey of the use of graph theoretical
More informationNewly made RNA is called primary transcript and is modified in three ways before leaving the nucleus:
m Eukaryotic mrna processing Newly made RNA is called primary transcript and is modified in three ways before leaving the nucleus: Cap structure a modified guanine base is added to the 5 end. Poly-A tail
More informationEvidence for dynamically organized modularity in the yeast protein-protein interaction network
Evidence for dynamically organized modularity in the yeast protein-protein interaction network Sari Bombino Helsinki 27.3.2007 UNIVERSITY OF HELSINKI Department of Computer Science Seminar on Computational
More informationCell biology traditionally identifies proteins based on their individual actions as catalysts, signaling
Lethality and centrality in protein networks Cell biology traditionally identifies proteins based on their individual actions as catalysts, signaling molecules, or building blocks of cells and microorganisms.
More informationHomology and Information Gathering and Domain Annotation for Proteins
Homology and Information Gathering and Domain Annotation for Proteins Outline Homology Information Gathering for Proteins Domain Annotation for Proteins Examples and exercises The concept of homology The
More informationLecture Notes for Fall Network Modeling. Ernest Fraenkel
Lecture Notes for 20.320 Fall 2012 Network Modeling Ernest Fraenkel In this lecture we will explore ways in which network models can help us to understand better biological data. We will explore how networks
More informationTopic 4 - #14 The Lactose Operon
Topic 4 - #14 The Lactose Operon The Lactose Operon The lactose operon is an operon which is responsible for the transport and metabolism of the sugar lactose in E. coli. - Lactose is one of many organic
More informationV14 Graph connectivity Metabolic networks
V14 Graph connectivity Metabolic networks In the first half of this lecture section, we use the theory of network flows to give constructive proofs of Menger s theorem. These proofs lead directly to algorithms
More informationOxidative Phosphorylation versus. Photophosphorylation
Photosynthesis Oxidative Phosphorylation versus Photophosphorylation Oxidative Phosphorylation Electrons from the reduced cofactors NADH and FADH 2 are passed to proteins in the respiratory chain. In eukaryotes,
More informationComparative genomics: Overview & Tools + MUMmer algorithm
Comparative genomics: Overview & Tools + MUMmer algorithm Urmila Kulkarni-Kale Bioinformatics Centre University of Pune, Pune 411 007. urmila@bioinfo.ernet.in Genome sequence: Fact file 1995: The first
More informationComputational Biology: Basics & Interesting Problems
Computational Biology: Basics & Interesting Problems Summary Sources of information Biological concepts: structure & terminology Sequencing Gene finding Protein structure prediction Sources of information
More informationRegulation of Gene Expression
Chapter 18 Regulation of Gene Expression Edited by Shawn Lester PowerPoint Lecture Presentations for Biology Eighth Edition Neil Campbell and Jane Reece Lectures by Chris Romero, updated by Erin Barley
More informationC3020 Molecular Evolution. Exercises #3: Phylogenetics
C3020 Molecular Evolution Exercises #3: Phylogenetics Consider the following sequences for five taxa 1-5 and the known outgroup O, which has the ancestral states (note that sequence 3 has changed from
More informationUnderstanding Science Through the Lens of Computation. Richard M. Karp Nov. 3, 2007
Understanding Science Through the Lens of Computation Richard M. Karp Nov. 3, 2007 The Computational Lens Exposes the computational nature of natural processes and provides a language for their description.
More informationGACE Biology Assessment Test I (026) Curriculum Crosswalk
Subarea I. Cell Biology: Cell Structure and Function (50%) Objective 1: Understands the basic biochemistry and metabolism of living organisms A. Understands the chemical structures and properties of biologically
More informationCo-ordination occurs in multiple layers Intracellular regulation: self-regulation Intercellular regulation: coordinated cell signalling e.g.
Gene Expression- Overview Differentiating cells Achieved through changes in gene expression All cells contain the same whole genome A typical differentiated cell only expresses ~50% of its total gene Overview
More informationBioinformatics: Network Analysis
Bioinformatics: Network Analysis Comparative Network Analysis COMP 572 (BIOS 572 / BIOE 564) - Fall 2013 Luay Nakhleh, Rice University 1 Biomolecular Network Components 2 Accumulation of Network Components
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationBioinformatics I. CPBS 7711 October 29, 2015 Protein interaction networks. Debra Goldberg
Bioinformatics I CPBS 7711 October 29, 2015 Protein interaction networks Debra Goldberg debra@colorado.edu Overview Networks, protein interaction networks (PINs) Network models What can we learn from PINs
More informationReception The target cell s detection of a signal coming from outside the cell May Occur by: Direct connect Through signal molecules
Why Do Cells Communicate? Regulation Cells need to control cellular processes In multicellular organism, cells signaling pathways coordinate the activities within individual cells that support the function
More informationOverview. Overview. Social networks. What is a network? 10/29/14. Bioinformatics I. Networks are everywhere! Introduction to Networks
Bioinformatics I Overview CPBS 7711 October 29, 2014 Protein interaction networks Debra Goldberg debra@colorado.edu Networks, protein interaction networks (PINs) Network models What can we learn from PINs
More informationBig Idea 3: Living systems store, retrieve, transmit and respond to information essential to life processes. Tuesday, December 27, 16
Big Idea 3: Living systems store, retrieve, transmit and respond to information essential to life processes. Enduring understanding 3.B: Expression of genetic information involves cellular and molecular
More informationGenetic Variation: The genetic substrate for natural selection. Horizontal Gene Transfer. General Principles 10/2/17.
Genetic Variation: The genetic substrate for natural selection What about organisms that do not have sexual reproduction? Horizontal Gene Transfer Dr. Carol E. Lee, University of Wisconsin In prokaryotes:
More informationStructure and Centrality of the Largest Fully Connected Cluster in Protein-Protein Interaction Networks
22 International Conference on Environment Science and Engieering IPCEE vol.3 2(22) (22)ICSIT Press, Singapoore Structure and Centrality of the Largest Fully Connected Cluster in Protein-Protein Interaction
More informationZool 3200: Cell Biology Exam 5 4/27/15
Name: Trask Zool 3200: Cell Biology Exam 5 4/27/15 Answer each of the following short answer questions in the space provided, giving explanations when asked to do so. Circle the correct answer or answers
More informationControlling Gene Expression
Controlling Gene Expression Control Mechanisms Gene regulation involves turning on or off specific genes as required by the cell Determine when to make more proteins and when to stop making more Housekeeping
More informationSUPPLEMENTARY METHODS
SUPPLEMENTARY METHODS M1: ALGORITHM TO RECONSTRUCT TRANSCRIPTIONAL NETWORKS M-2 Figure 1: Procedure to reconstruct transcriptional regulatory networks M-2 M2: PROCEDURE TO IDENTIFY ORTHOLOGOUS PROTEINSM-3
More information56:198:582 Biological Networks Lecture 9
56:198:582 Biological Networks Lecture 9 The Feed-Forward Loop Network Motif Subgraphs in random networks We have discussed the simplest network motif, self-regulation, a pattern with one node We now consider
More informationLecture 4: Transcription networks basic concepts
Lecture 4: Transcription networks basic concepts - Activators and repressors - Input functions; Logic input functions; Multidimensional input functions - Dynamics and response time 2.1 Introduction The
More information