Towards More Realistic Affinity Maturation Modeling Erich R. Schmidt, Steven H. Kleinstein Department of Computer Science, Princeton University July 19,

Slides:



Advertisements
Similar presentations
Rolls-Royce supported University Technology Centre in Control and Systems Engineering UK e-Science DAME Project Alex Shenfield
Advertisements

Omri Barak Collaborators: Larry Abbott David Sussillo Misha Tsodyks Sloan-Swartz July 12, 2011 Messy nice stuff & Nice messy stuff.
Motion Planning for Point Robots CS 659 Kris Hauser.
©GoldSim Technology Group LLC., 2012 Optimization in GoldSim Jason Lillywhite and Ryan Roper June 2012 Webinar.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
27803::Systems Biology1CBS, Department of Systems Biology Schedule for the Afternoon 13:00 – 13:30ChIP-chip lecture 13:30 – 14:30Exercise 14:30 – 14:45Break.
Simulation Models as a Research Method Professor Alexander Settles.
© P. Pongcharoen ISA/1 Applying Designed Experiments to Optimise the Performance of Genetic Algorithms for Scheduling Capital Products P. Pongcharoen,
Systems Biology, April 25 th 2007Thomas Skøt Jensen Technical University of Denmark Networks and Network Topology Thomas Skøt Jensen Center for Biological.
CISC673 – Optimizing Compilers1/34 Presented by: Sameer Kulkarni Dept of Computer & Information Sciences University of Delaware Phase Ordering.
Seth Weinberg Acknowledgements: Xiao Wang, Yan Hao, Gregory Smith
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Elements of the Heuristic Approach
Statistical Methods For Engineers ChE 477 (UO Lab) Larry Baxter & Stan Harding Brigham Young University.
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Toward Quantitative Simulation of Germinal Center Dynamics Steven Kleinstein Dept. of Computer Science Princeton University J.P.
Estimating Hypermutation Rates During In Vivo Immune Responses Steven H. Kleinstein Department of Computer Science Princeton University.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
Investigation of the Effect of Neutrality on the Evolution of Digital Circuits. Eoin O’Grady Final year Electronic and Computer Engineering Project.
Project funded by the Future and Emerging Technologies arm of the IST Programme Analytical Insights into Immune Search Niloy Ganguly Center for High Performance.
The Truth About Parallel Computing: Fantasy versus Reality William M. Jones, PhD Computer Science Department Coastal Carolina University.
A genetic approach to the automatic clustering problem Author : Lin Yu Tseng Shiueng Bien Yang Graduate : Chien-Ming Hsiao.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Estimating the Mutation Rate from Clonal Tree Data Steven H. Kleinstein,Yoram Louzoun Princeton University Mark J. Shlomchik Yale University.
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
Why are there so few key mutant clones? Why are there so few key mutant clones? The influence of stochastic selection and blocking on affinity maturation.
Spatial Analyst - Cost Distance Analysis Kevin M. Johnston.
Estimating Mutation Rates from Clonal Tree Data (using modeling to understand the immune system) Steven H. Kleinstein Department of Computer Science Princeton.
An Agent Epidemic Model Toward a general model. Objectives n An epidemic is any attribute that is passed from one person to others in society è disease,
Toward Quantitative Simulation of Germinal Center Dynamics Toward Quantitative Simulation of Germinal Center Dynamics Biological and Modeling Insights.
Mutability Driven Phase Transitions in a Neutral Phenotype Evolution Model Adam David Scott Department of Physics & Astronomy University of Missouri at.
Fitness Landscape Simulation Modeling Architecture and Component Research Laurent Mirabeau Igor Feldman Murat Cokol Ezra Goodnoe.
Simulating the Immune System Martin Weigert Department of Molecular Biology Steven Kleinstein, Erich Schmidt, Tim Hilton, J.P. Singh Department of Computer.
Active Walker Model for Bacterial Colonies: Pattern Formation and Growth Competition Shane Stafford Yan Li.
© P. Pongcharoen CCSI/1 Scheduling Complex Products using Genetic Algorithms with Alternative Fitness Functions P. Pongcharoen, C. Hicks, P.M. Braiden.
Genetic Algorithm(GA)
Slide 1 SLIP 2004 Payman Zarkesh-Ha, Ken Doniger, William Loh, and Peter Bendix LSI Logic Corporation Interconnect Modeling Group February 14, 2004 Prediction.
Haploid-Diploid Evolutionary Algorithms
Machine Learning Supervised Learning Classification and Regression
OPERATING SYSTEMS CS 3502 Fall 2017
Independent Cascade Model and Linear Threshold Model
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Exploratory Decomposition Dr. Xiao Qin Auburn.
Cellular automata.
Department of Computer Science
Online Multiscale Dynamic Topic Models
HyperNetworks Engın denız usta
Chapter 12 B-Cell Activation and Differentiation Dr. Capers
Daniil Chivilikhin and Vladimir Ulyantsev
Ec1818 Economics of Discontinuous Change Section 2 [Lectures 5-7]
Stochastic Simulation of thymic Selection
Center for Complexity in Business, R. Smith School of Business
Department of Electrical & Computer Engineering
Representation and Evolution of Lego-based Assemblies
Haploid-Diploid Evolutionary Algorithms
Independent Cascade Model and Linear Threshold Model
metaheuristic methods and their applications
Bin Fu Department of Computer Science
Department of Computer Science University of York
BNFO 602 Phylogenetics – maximum parsimony
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
Schedule for the Afternoon
School of Computer Science & Engineering
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
Methods and Materials (cont.)
Bharathi-Kempe-Salek Conjecture
학습목표 공진화의 개념을 이해하고, sorting network에의 응용가능성을 점검한다
MECH 3550 : Simulation & Visualization
Independent Cascade Model and Linear Threshold Model
Presentation transcript:

Towards More Realistic Affinity Maturation Modeling Erich R. Schmidt, Steven H. Kleinstein Department of Computer Science, Princeton University July 19, 2001

Germinal center models Recent germinal center models: simple responses (haptens – Ox, NP) single affinity- increasing mutation simple B cell model no inter-cellular signals no internal dynamics Address limitations: more complex receptor affinity space multiple affinity- increasing mutations more realistic model of B cell inter-cellular signals signal memory

Simulation B cell receptor affinity B cell Germinal center More complex, realistic Specific: Ox, NP Discrete/ stochastic simulation affinity landscape internal dynamics population dynamics

Affinity landscapes: NK landscape model N: sequence length  receptor space size K: internal interactions  landscape ruggedness NK : easy to model different antigen, check stats vs. experimental data K=0K=mediumK=highOx,NP

NK parameter values proposed by Kauffman/Weinberger: correctly predicts: number of steps to local optima fraction of higher-affinity neighbors “conserved” sites in local optima

Individual mutations vs. population dynamics Kauffman/Weinberger: single cell walk mutations: uphill no time no other events Our simulation: entire population dynamics mutations: random time-dependent division, death

Simulation B cell receptor affinity B cell Germinal center More complex, realistic Specific: phOx, NP Discrete/ stochastic simulation

B cell model – decision making network input node (receptor affinity) mutationdeathdivision output nodes (rates) functional nodes fitness function (division)

Germinal center model single seed all cells share same parameters dynamic, stochastic, discrete simulate for 14 days different steps: change network parameters search: best network for affinity maturation

Expectations Previous work: Ox, NP single affinity-increasing mutation fitness function = threshold NK landscape rugged, multiple peaks expected smaller slope Ox,NPNK

Results threshold select for small percentage of affinity- increasing mutations high-affinity seed

Results low affinity seed smaller slope very hard to walk up: smaller slope doesn’t help overall affinity maturation

Conclusions dynamic model on NK landscape generates affinity maturation not reaching local optima best division rate is a threshold function affinity of seeding cell important factor total mutation count consistent with bio data Kauffman: all mutations up our simulation: random mutations (up+down)

Future work more complex decision network optimization problem: mutate network, not only parameters B cell receptor affinity B cell Germinal center More complex, realistic Specific: phOx, NP Discrete/ stochastic simulation More realistic

Acknowledgements Steven Kleinstein, Jaswinder Pal Singh Martin Weigert Stuart A. Kauffman, Edward D. Weinberger, Bennett Levitan (Santa Fe)

The End