Biological Networks and Pathways Study Guide
Administrative Announcements and Course Schedule
- Midterm Grade Distribution:
- The mean score for the midterm was 92.
- The median score for the midterm was 94.
- Several students achieved a perfect score of 100%.
- Students at the lower end of the distribution are encouraged to speak with the instructors regarding concerns.
- Final Exam Details:
- The final exam is not cumulative; it covers only four lectures and one discussion section delivered after the midterm.
- Today's lecture on biological networks is the fourth and final lecture included in the exam material.
- The proteomics student lectures are not included in the final exam content, as the process of preparing and delivering those lectures is considered a major separate effort.
- The format of the final exam questions will be similar to the midterm.
- Upcoming Schedule Overview:
- Week 8, Monday: No lecture (time allocated for presentation preparation).
- Week 8, Wednesday: No discussion section (time allocated for presentation preparation).
- Week 8, Friday: Student Presentation Session 1.
- Week 9, Monday: Holiday (No class).
- Week 9, Wednesday & Friday: Continuation of student presentations.
- Week 10, Monday & Wednesday: In-class review for the final exam and review in discussion sections.
- Week 10, Friday: Final Exam.
- Proteomics Presentation Requirements:
- Slides and questions are due by Noon on May 21.
- Each student must submit two questions per topic (2 questions for every topic assigned in the class, not just their own).
- These questions are graded and form a portion of the proteomics grade.
- Instructors will select from the submitted questions to ask during the Q&A portion of the presentations.
Introduction to Biological Systems and Networks
- The Biological Hierarchy (Complexity Pyramid):
- Level 1 (Individual Molecules): Atoms, genes, RNA, and proteins.
- Level 2 (Functional Modules): Small regulatory motifs and functional units created by interacting parts.
- Level 3 (Pathways): Larger functional structures composed of multiple modules.
- Level 4 (Systems): Large-scale organization and systems-level networks.
- The Importance of Interaction: Complexity in life is dictated by molecules interacting with each other rather than the molecules existing in isolation. Molecular systems biology focuses on understanding these connections.
- Ubiquitous Network Types:
- Evolutionary/Phylogenetic Networks: Tracing lineage and relationships over time.
- Ecological Networks: Interactions between organisms in an environment.
- Expression Networks: Inferred relationships based on gene expression patterns.
- Regulatory Networks: Capture functional consequences (e.g., which genes regulate others) rather than just correlation.
- Protein-Protein Interaction (PPI) Networks: Biophysical networks based on physical contact between proteins.
- Metabolic Networks: Biochemical reactions occurring within a cell.
Experimental Identification: The Yeast Two-Hybrid (Y2H) Assay
- Focus on Protein-Protein Interactions (PPI): Binding can result in recruitment of proteins to specific genomic loci, or induce conformational changes critical for protein function.
- Basic Principle of Y2H:
- Uses a reporter gene (e.g., GFP) whose expression is controlled by an upstream promoter.
- Transcription factors are modular; the DNA Binding Domain (BD) and the Activation Domain (AD) can function when physically separated but brought into proximity.
- The Components:
- The Bait: A known protein of interest fused to the DNA Binding Domain (BD).
- The Prey: A protein (often from a library) fused to the Activation Domain (AD).
- The Mechanism:
- Both fusion proteins are expressed in a yeast cell.
- The BD of the bait binds to the promoter of the reporter gene.
- If the bait and prey interact physically, the AD is brought close enough to the promoter to initiate transcription of the reporter gene.
- Readouts: GFP (fluorescence) or survival factors (e.g., antibiotic resistance or nutritional markers).
- Advantages:
- In vivo method (occurs inside a living yeast cell).
- Simple and elegant design.
- High-throughput: Can be used to screen libraries of prey proteins against a single bait.
- Capable of detecting transient interactions.
- Limitations:
- Chimeras: Fusing domains to proteins may cause conformational changes that alter or inhibit natural function.
- Environment: Yeast cells do not always provide the correct context for human protein interactions (e.g., post-translational modifications or localization).
- Localization issues: Proteins that never meet in a human cell (e.g., one nuclear, one cytoplasmic) might show an interaction in Y2H that is not biologically relevant in vivo.
- Binary constraint: It typically only detects interactions between two proteins; it cannot easily identify interactions that require a large protein complex to be stable.
Technical Network Terminology and Properties
- Nodes and Edges:
- Nodes: Represent biological units (proteins, genes, metabolites).
- Edges: Represent relationships (physical interaction, regulation, co-expression).
- Types of Edges:
- Directed: Arrows represent activation (→); flat bars represent inhibition (⊣).
- Undirected: Simply represent a connection without specified direction.
- Node Degree (Connectivity, k):
- Defined as the number of links a node has to other nodes.
- Undirected Networks: Count all connected edges.
- Directed Networks:
- Incoming Degree (Kin): Number of edges pointing into the node.
- Outgoing Degree (Kout): Number of edges pointing away from the node.
- Degree Distribution (P(k)):
- The probability that a randomly selected node has exactly k links.
- Observed Degree Distribution: Calculated by counting the number of nodes with k links (n(k)) and dividing by the total number of nodes (Ntotal).
- P(k)=NtotalN(k).
Scale-Free Networks and the Power Law
- Power Law Definition: Biological networks are described as "Scale-Free" because their degree distribution follows a power law asymptotically.
- Equation: P(k)≈k−γ, where γ (gamma) is a constant parameter specific to the network.
- Log-Log Characterization: Taking the logarithm of both sides results in a linear relationship: log(P(k))=−γlog(k).
- This results in a straight line with a negative slope on a log-log plot.
- Implication: The probability of finding a node with a very high degree (a "hub") decreases exponentially as k increases. Highly connected nodes (hubs) are rare, while nodes with few connections are very common.
- Examples of Scale-Free Networks:
- Movie actor collaboration networks.
- The Internet (links between web pages).
- Power grids.
- Protein interaction networks (e.g., the yeast proteome map).
Network Robustness and the "Small World" Phenomenon
- Small World Property: Any two nodes in a biological network can typically be connected by a path of only a few links (often 3 to 5 hops).
- This means local perturbations (e.g., changes in one metabolite concentration) can spread through the entire network efficiently.
- Robustness: The ability of a system to maintain function despite errors or failures.
- Resilience to Random Failure: Because most nodes are not hubs, random mutations or failures likely hit low-connectivity nodes, leaving the overall network structure intact.
- Sensitivity to Targeted Attacks: Because hubs are the "glue" of the network, targeted disruption of a hub is lethal and can pull the entire network apart.
- Medical Application: Drug development often targets hub genes in cancer-related networks to effectively kill malignant cells, though this can lead to side effects due to the hub's many connections.
Pathways and Enrichment Analysis
- Distinction Between Networks and Pathways:
- All pathways are networks, but not all networks are pathways.
- Pathways: A subset of a network with a specific functional label, biological process, or phenotypic outcome.
- Modules: Interacting molecules that fulfill a specific unit of function.
- Pathway Overlap and Enrichment Analysis:
- Used to determine if a set of differentially expressed genes (DEGs) is significantly associated with a known pathway.
- Expected Overlap Calculation:
- Expected Overlap=Total Number of Background Genes(Size of DEG List×Size of Pathway)
- Example: If your list has 200 genes, the pathway has 100, and the genome (background) has 20,000, the expected overlap by chance is 20,000200×100=1.
- If your observed overlap is 8, this is significantly higher than the expected 1.
- KEGG (Kyoto Encyclopedia of Genes and Genomes):
- A major public database used to study pathways.
- Allows users to search by gene to see involved pathways or compare pathways across species.
Questions & Discussion
- Q: Regarding references for the presentation, is there a limit or requirement?
- A: There is no specific limit; use as many as you actually utilized for your research.
- Q: Is Yeast Two-Hybrid (Y2H) a good technique to use for extracellular proteins?
- A: No. Extracellular proteins are secreted outside the cell, meaning they likely won't reach sufficient abundance within the yeast cell environment to show interaction readouts.
- Q: If I discover a novel gene using RNA-Seq and predict an Open Reading Frame (ORF), can I use Y2H even if it's never been studied?
- A: Yes. You can clone the ORF into a plasmid, create a fusion protein, and test it in yeast without knowing its function or structure beforehand.
- Q: To make the fusion protein, do we need to know the structure of the protein?
- A: No, you only need the sequence of the Open Reading Frame. You can attach the fusion domain to either the N-terminal or C-terminal, though you must be careful as this can sometimes affect the protein's native folding.