Embedding Computation in Studies of Protein Structure and Function Chris Bailey-Kellogg & lab & collaborators Shobha Xiaoduan Wei John Chris Fei.

Slides:



Advertisements
Similar presentations
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California
Advertisements

Is Random Model Better? -On its accuracy and efficiency-
A Separate Analysis Approach to the Reconstruction of Phylogenetic Networks Luay Nakhleh Department of Computer Sciences UT Austin.
SA-1 Probabilistic Robotics Planning and Control: Partially Observable Markov Decision Processes.
Yvan Rooseleer – BiASC – MAY 2013
05/27/2006 Modeling and Determining the Structures of Proteins and Macromolecular Assemblies Depts. of Biopharmaceutical Sciences and Pharmaceutical Chemistry.
Robust Object Tracking via Sparsity-based Collaborative Model
Simulation of End-of-Life Computer Recovery Operations Design Team Jordan Akselrad, John Marshall Mikayla Shorrock, Nestor Velilla Nicolas Yunis Project.
Oklahoma State University Generative Graphical Models for Maneuvering Object Tracking and Dynamics Analysis Xin Fan and Guoliang Fan Visual Computing and.
VADE - Virtual Assembly Design Environment Virtual Reality & Computer Integrated Manufacturing Lab.
Dynamics of Learning & Distributed Adaptation PI: James P. Crutchfield, Santa Fe Institute Agent-Based Computing Grantee Meeting 3-5 October 2000 Dynamics.
1 A hybrid particle swarm optimization algorithm for optimal task assignment in distributed system Peng-Yeng Yin and Pei-Pei Wang Department of Information.
Lock Inference for Systems Software John Regehr Alastair Reid University of Utah March 17, 2003.
Automated Changes of Problem Representation Eugene Fink LTI Retreat 2007.
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
A Sparsification Approach for Temporal Graphical Model Decomposition Ning Ruan Kent State University Joint work with Ruoming Jin (KSU), Victor Lee (KSU)
Probabilistic methods for phylogenetic trees (Part 2)
Protein Structure Prediction Samantha Chui Oct. 26, 2004.
Computational Structure-Based Redesign of Enzyme Activity Cheng-Yu Chen, Ivelin Georgiev, Amy C.Anderson, Bruce R.Donald A Different computational redesign.
Science and Engineering Practices
Aeronautics & Astronautics Autonomous Flight Systems Laboratory All slides and material copyright of University of Washington Autonomous Flight Systems.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
LÊ QU Ố C HUY ID: QLU OUTLINE  What is data mining ?  Major issues in data mining 2.
IE 594 : Research Methodology – Discrete Event Simulation David S. Kim Spring 2009.
Computer-Assisted Drug Design (1) i)Random Screening ii)Lead Development and Optimization using Multivariate Statistical Analyses. iii)Lead Generation.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
/09/dji-phantom-crashes-into- canadian-lake/
THEME 1: Improving the Experimentation and Discovery Process Unprecedented complexity of scientific enterprise Is science stymied by the human bottleneck?
CDT PROJECTS John Keane, Software Systems Group 1. Data Analytics / Big Data 2. Parallel & Distributed Systems 3. Decision Support.
Managerial Decision Making and Problem Solving
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Playing Biology ’ s Name Game: Identifying Protein Names In Scientific Text Daniel Hanisch, Juliane Fluck, Heinz-Theodor Mevissen and Ralf Zimmer Pac Symp.
Protein Classification II CISC889: Bioinformatics Gang Situ 04/11/2002 Parts of this lecture borrowed from lecture given by Dr. Altman.
Vision-based human motion analysis: An overview Computer Vision and Image Understanding(2007)
Abstract ODE System Model of GRNs Summary Evolving Small GRNs with a Top-Down Approach Javier Garcia-Bernardo* and Margaret J. Eppstein Department of Computer.
Design, Optimization, and Control for Multiscale Systems
Real-Time Support for Mobile Robotics K. Ramamritham (+ Li Huan, Prashant Shenoy, Rod Grupen)
Slides for “Data Mining” by I. H. Witten and E. Frank.
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
CoNMF: Exploiting User Comments for Clustering Web2.0 Items Presenter: He Xiangnan 28 June School of Computing National.
03/27/09 NIH Roadmap Structure Determination of Membrane Proteins from Orientational Constraints Homayoun Valafar Roadmap Initiative Meeting 3/26/09-3/27/09.
MINRMS: an efficient algorithm for determining protein structure similarity using root-mean-squared-distance Andrew I. Jewett, Conrad C. Huang and Thomas.
Data Mining and Decision Support
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Application of machine learning to RCF decision procedures Zongyan Huang.
Relevance of Complex Network Properties Philippe Giabbanelli «Impact of complex network properties on routing in backbone networks» Philippe Giabbanelli,
G LOBAL S IMILARITY B ETWEEN M ULTIPLE B IONETWORKS Yunkai Liu Computer Science Department University of South Dakota.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Instructional Design Document Simplex Method - Optimization STAM Interactive Solutions.
Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability Primer Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability.
Graphical Models for Segmenting and Labeling Sequence Data Manoj Kumar Chinnakotla NLP-AI Seminar.
© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Ning Jin, Wei Wang ICDE 2011 LTS: Discriminative Subgraph Mining by Learning from Search History.
Decision Support Systems
Purpose Design your own experimental procedures. Decide
COSC 6367 Project 3—2012 You will provide a survey on “Recent Developments in X” where X is a subfield of Evolutionary Computing or a popular application.
Support Vector Machines Introduction to Data Mining, 2nd Edition by
Digital Processing Platform
Joelle Pineau: General info
Structured Models for Multi-Agent Interactions
Towards Next Generation Panel at SAINT 2002
Sample 10-minute research proposal presentation by
Ernest Valveny Computer Vision Center
Bioinformatics, Vol.17 Suppl.1 (ISMB 2001) Weekly Lab. Seminar
Resource Allocation for Distributed Streaming Applications
Reinforcement Learning Dealing with Partial Observability
Purpose Design your own experimental procedures. Decide
Multidisciplinary Optimization
Presentation transcript:

Embedding Computation in Studies of Protein Structure and Function Chris Bailey-Kellogg & lab & collaborators Shobha Xiaoduan Wei John Chris Fei

What does it look like? Generate models Optimize set of experimental probes Evaluate models wrt data Characterize differences

What does it look like? Represent entire sol’n space Prune parts inconsistent w/data Evaluate uncertainty in remainder

What does it do (how, why)? K V A V V L Q W I L K W G F A L Q C P K S C A L V V L S I A D L A V V L R G I T T C I I L L H G A M E M L H I L P V L S E L L T V L P N V D Q K A T V L L N I F R I F Y P L I S K Y C M I L A L M T V E C T A V V L M A I K Analyze evolutionary record Infer graphical model Analyze, predict, classify

What does it do (how, why)? Represent NMR data as graph Represent structure as graph Use isomorphisms to localize interactions, dynamics

How can we change it? Recombination: mix-and-match fragments from related proteins Evaluate breakpoint locations wrt constraints, diversity Optimize by dynamic programming

How can we change it? Optimize robotic assembly of hybrid library

Embedded Computation Minimize experimental complexity Be robust to sparsity and noise Maximize information gain Employ appropriate representations Search efficiently over possibilities Combine sources of information Quantify uncertainty Change approach to experiment and analysis: assumptions, experiments, and overall process