Ehsan Ullah, Prof. Soha Hassoun Department of Computer Science Mark Walker, Prof. Kyongbum Lee Department of Chemical and Biological Engineering Tufts.

Slides:



Advertisements
Similar presentations
1 Scheduling Crossbar Switches Who do we chose to traverse the switch in the next time slot? N N 11.
Advertisements

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
Predicting essential genes via impact degree on metabolic networks ISSSB’11 Takeyuki Tamura Bioinformatics Center, Institute for Chemical Research Kyoto.
Engineering of Biological Processes Lecture 6: Modeling metabolism Mark Riley, Associate Professor Department of Ag and Biosystems Engineering The University.
An iterative algorithm for metabolic network-based drug target identification Padmavati Sridhar, Tamer Kahveci, Sanjay Ranka Department of Computer and.
Ferhat Ay, Tamer Kahveci & Valerie de-Crecy Lagard 4/17/20151 Ferhat Ay
Glycolysis Glucose utilization in cells of higher plants and animals.
Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs Neha Rungta, Hyrum Carroll, Eric Mercer, Mark Clement, and Quinn Snell Computer.
Mona Yousofshahi, Prof. Soha Hassoun Department of Computer Science Prof. Kyongbum Lee Chemical & Biological Engineering Tufts University 1.
Nick McKeown Spring 2012 Maximum Matching Algorithms EE384x Packet Switch Architectures.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Lecture 4 Tuesday, 2/19/02 Graph Algorithms: Part 2 Network.
VLSI Layout Algorithms CSE 6404 A 46 B 65 C 11 D 56 E 23 F 8 H 37 G 19 I 12J 14 K 27 X=(AB*CD)+ (A+D)+(A(B+C)) Y = (A(B+C)+AC+ D+A(BC+D)) Dr. Md. Saidur.
What you should know from today’s lecture The importance of glycolysis, fermentation, and respiration (Krebs cycle) in biology The site of glycolysis,
In silico aided metaoblic engineering of Saccharomyces cerevisiae for improved bioethanol production Christoffer Bro et al
Geometric Approaches to Reconstructing Times Series Project Outline 15 February 2007 CSC/Math 870 Computational Discrete Geometry Connie Phong.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2004 Lecture 5 Wednesday, 10/6/04 Graph Algorithms: Part 2.
1 Scheduling Crossbar Switches Who do we chose to traverse the switch in the next time slot? N N 11.
Gluconeogenesis COURSE TITLE: BIOCHEMISTRY 2 COURSE CODE: BCHT 202 PLACEMENT/YEAR/LEVEL: 2nd Year/Level 4, 2nd Semester M.F.Ullah, Ph.D.
Anaerobic Cellular Respiration: Lactate Fermentation and Ethanol Fermentation Sec. 7.4.
B-3.2: Summarize the basic aerobic and anaerobic processes of cellular respiration and interpret the chemical equation for cellular respiration.
© 2015 H. Scott Hinton Lesson: E.coli Metabolic CoreBIE 5500/6500Utah State University Constraint-based Metabolic Reconstructions & Analysis E.coli CORE.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
AP BIOLOGY Chapter 8, 9, 10. Metabolism General pathways Anabolism Catabolism Energy Forms Kinetic Potential Laws 1 st law of thermodynamics 2 nd law.
Lecture #23 Varying Parameters. Outline Varying a single parameter – Robustness analysis – Old core E. coli model – New core E. coli model – Literature.
Chapter 14.4: Gluconeogenesis CHEM 7784 Biochemistry Professor Bensley.
Metabolism: FON 241; L. Zienkewicz Metabolism Chapter 7.
Advanced Algorithm Design and Analysis (Lecture 13) SW5 fall 2004 Simonas Šaltenis E1-215b
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,
CHAPTER 15 Metabolism: Basic Concepts and Design.
Announcements Network Flow today, depending on how far we get, we will do String Matching on Wednesday Then Review for Final next Monday This week’s lab.
Cellular Respiration Cellular respiration is the controlled release of energy from organic compounds (lipids, carbohydrates and proteins) in cells to produce.
Overview of Energy-Releasing Pathways AP Biology Fall 2010.
Anaerobic Respiration Learning objectives explain why anaerobic respiration produces a much lower yield of ATP than aerobic respiration; define.
February 14 Chapter 26 Amino Acid Metabolism
An Efficient Algorithm for Enumerating Pseudo Cliques Dec/18/2007 ISAAC, Sendai Takeaki Uno National Institute of Informatics & The Graduate University.
Human Physiology Cell Respiration and Metabolism Chapter 2.
CSCI 3160 Design and Analysis of Algorithms Chengyu Lin.
Clustering Metabolic Networks Using Minimum Cut Trees Ryan Kellogg 1, Allison Heath 2, Lydia Kavraki 2,3 1 Carnegie Mellon University, Department of Electrical.
Intel Confidential – Internal Only Co-clustering of biological networks and gene expression data Hanisch et al. This paper appears in: bioinformatics 2002.
Principles of Metabolic Regulation: Glucose and Glycogen Part 1 Chapter 15.
Greedy algorithm for obtaining Minimum Feedback vertex set MFVS delete degree 1/0 vertices from V and set remaining vertices to V’ MFVS←  while V’  
Ch. 5 Part Two: Respiration. Cellular Respiration Respiration Transfers the energy in organic compounds (glucose) to make ATP C 6 H 12 O 6 + 6O
Chapter 8 Cellular respiration. Why Energy All active organisms use energy Carbon dioxide and water are both metabolic by-products produced by living.
Announcements Finish up Network Flow today Then Review for Final on Monday ◦ HW#5 is due on Monday, let me or the TA’s know if you have trouble starting.
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition Frank DiMaio and Jude Shavlik Computer Sciences Department University.
Homework 1 Problem 1: (5 points) Both Dijkstras algorihm and Bellmanford Algorithm generates shortest paths to all destinations. Modify the algorithm to.
David Stotts Computer Science Department UNC Chapel Hill.
3.7 Cellular Respiration Cellular respiration is the controlled release of energy from organic compounds (lipids, carbohydrates and proteins) in cells.
Network applications Sushmita Roy BMI/CS 576 Dec 9 th, 2014.
Robodog Frontal Facial Recognition AUTHORS GROUP 5: Jing Hu EE ’05 Jessica Pannequin EE ‘05 Chanatip Kitwiwattanachai EE’ 05 DEMO TIMES: Thursday, April.
Biology 105 Chapter 8: How cells make ATP Pgs Chapter 8: How cells make ATP Pgs
Major Metabolic Pathway Dr. Saleha Shamsudin. Introduction to metabolism and bioenergetics. Glucose metabolism: Glycolysis and TCA cycle, Respiration.
Pathway Team SNU, IDB Lab. DongHyuk Im DongHee Lee.
Data Structures and Algorithms
Lecture 13 Shortest Path.
Topic 2.8 – Cell respiration Understandings
Anaerobic respiration
Connected Components Minimum Spanning Tree
CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014
4-4 Graph Theory Trees.
GreedyMaxCut a b w c d e 1.
University of Pennsylvania School of Medicine Department of Radiology
Anaerobic respiration
Minho Noh, Seung Min Yoo, Won Jun Kim, Sang Yup Lee  Cell Systems 
Scheduling Crossbar Switches
Lecture 12 Shortest Path.
Presentation transcript:

Ehsan Ullah, Prof. Soha Hassoun Department of Computer Science Mark Walker, Prof. Kyongbum Lee Department of Chemical and Biological Engineering Tufts University

(Atsumi et al., 2008) (Trinh et al., 2006) (Steen et al., 2010) Embedding new pathways Removing pathways Improving existing pathways 2

 Enumeration ◦ Elementary Flux Mode ( Schuster et al., 2000)  Graph traversal ◦ Dominant-Edge Pathway Algorithm (Ullah et al., 2009) ◦ Favorite Path Algorithm* s b R1R1 c R2R2 e R4R4 t R6R6 R5R5 d R3R3 Dominant- Edge 1 st 3 rd 2 nd 4 th 3 *Unpublished

 Flux variations arise from different conditions  Given a metabolic network graph G = (V,E), source vertex s and destination vertex t and a flux range associated with each edge, find the predictably profitable path in the graph 4

R 5 (4) d R 3 (4) R 5 (4) d R 3 (4) A network in which any path from s to t can carry at minimum v p amount of flux  G p = G(V,E) such that w e ≥ v p  v p is obtained from the best flux-limiting step s b R 1 (10) c R 2 (6) e R 4 (6) t R 6 (10) 5

R 5 [3 11] d R 3 [7 12] R 5 [3 11] d R 3 [7 12]  A path in the network having reactions with smallest variations in flux s b R 1 [10 15] c R 2 [8 14] e R 4 [6 10] t R 6 [9 18] 6

1. Identification of profitable network a)Assign the lower limit of each flux range as edge weight b)Find flux limiting step using favorite path algorithm c)Prune all edges having weight less than the flux liming step found in (b) 2. Identification of predictable path in profitable network a)Assign the flux ranges as edge weight b)Use favorite path algorithm to find predictably profitable path 7

 Escherichia coli ◦ 62 Reactions ◦ 51 Compounds  Liver Cell ◦ 121 Reactions ◦ 126 Compounds 8

Escherichia coli 9  Production of ethanol from glucose in anaerobic state  Flux data generated from Carlson, R., Scrienc, F. 2004

10 glucose ethanol Escherichia coli PEP Pyruvate

 Flux-limiting step 11 Flux Limiting Step glucose ethanol Escherichia coli PEP Pyruvate

 Flux-limiting step  Profitable network 12 Profitable Network glucose ethanol Escherichia coli PEP Pyruvate

 Flux-limiting step  Profitable network  Predictably profitable path  Glycolysis is more predictable than PPP  Matches maximal production path identified by (Trinh et al., 2006) 13 Glycolysis glucose ethanol Escherichia coli PEP Pyruvate

 Production of glutathione from glucose  Flux data taken from HepG2 cultures*  Two observed states ◦ Drug free state ◦ Drug fed state (0.1mM of Troglitazone) *Unpublished results 14

15 glucose glu cys ala gly gluglutathione akg lys

 Drug free state 16 glucose glu cys ala gly gluglutathione akg lys

 Drug free state ◦ PPP, Alanine biosynthesis, Lysine degradation 17 glucose glu cys ala gly gluglutathione akg lys

 Drug fed state 18 glucose glu cys ala gly gluglutathione akg lys

 Drug fed state ◦ PPP, Cystine biosynthesis 19 glucose glu cys ala gly gluglutathione akg lys

 Efficient way of identifying target pathways for analyzing and engineering metabolic networks  Capable of handling variations in flux data  Polynomial runtime 20