Inference of Gene Relations from Microarray Data by Abduction Irene Papatheodorou & Marek Sergot Imperial College, London UK.

Slides:



Advertisements
Similar presentations
Explanation-Based Learning (borrowed from mooney et al)
Advertisements

Analytical Learning.
ARSPA04Sadri, Toni1 A Logic-Based Approach to Reasoning with Beliefs about Trust ARSPA 2004 Fariba Sadri 1 and Francesca Toni 1,2 1: Department of Computing,
Bayesian Abductive Logic Programs Sindhu Raghavan Raymond J. Mooney The University of Texas at Austin 1.
UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Mar, 4, 2015 Slide credit: some slides adapted from Stuart.
CSE Fall. Summary Goal: infer models of transcriptional regulation with annotated molecular interaction graphs The attributes in the model.
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Luís Moniz Pereira CENTRIA, Departamento de Informática Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and Technology.
Proof System HY-566. Proof layer Next layer of SW is logic and proof layers. – allow the user to state any logical principles, – computer can to infer.
Programming Language Semantics Mooly SagivEran Yahav Schrirber 317Open space html://
Knoweldge Representation & Reasoning
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal Pierangelo Dell’Acqua Dept. of Science and Technology.
Semantics with Applications Mooly Sagiv Schrirber html:// Textbooks:Winskel The.
Welcome to Biology 101 Course goals Course information Text Grading.
SCIENCE INQUIRY SC.8.N.1 Vocabulary
Inductive Logic Programming Includes slides by Luis Tari CS7741L16ILP.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
1 Knowledge Based Systems (CM0377) Lecture 12 (Last modified 2nd May 2002)
Reconstructing Gene Networks Presented by Andrew Darling Based on article  “Research Towards Reconstruction of Gene Networks from Expression Data by Supervised.
1 Abduction and Induction in Scientific Knowledge Development Peter Flach, Antonis Kakas & Oliver Ray AIAI Workshop 2006 ECAI August, 2006.
Combining Inductive Logic Programming, Active Learning and Robotics to Discover the Function of Genes by C.H. Bryant, S.H. Muggleton, S.G. Oliver, D.B.
Scientific Inquiry.
Logical Agents Logic Propositional Logic Summary
Learning Metabolic Network Inhibition using Abductive Stochastic Logic Programming Jianzhong Chen, Stephen Muggleton, José Santos Imperial College, London.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
CS4026 Formal Models of Computation Part II The Logic Model Lecture 2 – Prolog: History and Introduction.
The Scientific Method An approach to acquiring knowledge.
For Monday Finish chapter 19 No homework. Program 4 Any questions?
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
Ch. 13 Ch. 131 jcmt CSE 3302 Programming Languages CSE3302 Programming Languages (notes?) Dr. Carter Tiernan.
For Monday Finish chapter 19 Take-home exam due. Program 4 Any questions?
L. M. Pereira, J. J. Alferes, J. A. Leite Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal P. Dell’Acqua Dept. of Science.
Scientific Method Vocabulary
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Oct, 30, 2015 Slide credit: some slides adapted from Stuart.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
1 Knowledge Based Systems (CM0377) Lecture 6 (last modified 20th February 2002)
Introduction to Life Science. Science is a way of learning about the natural world Scientific inquiry – all the diverse ways in which scientist study.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
1 Applications of Symbolic Logic to Gene Regulation Systems Department of Computer Science and Information Engineering of National Chung-Cheng University.
Essential Questions What is biology? What are possible benefits of studying biology? What are the characteristics of living things? Introduction to Biology.
Chapter One The Science of Biology
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Introduction to Biology. Section 1  Biology and Society Biology  The study of life.
Scientific Methodology Vodcast 1.1 Unit 1: Introduction to Biology.
Chapter 1: Section 1 What is Science?. What Science IS and IS NOT.. The goal of Science is to investigate and understand the natural world, to explain.
Wagner Associates NCSD-ADS-DOC ARO Workshop on Cyber Situation Awareness RPD-inspired Hypothesis Reasoning for Cyber Situation Awareness.
On Abductive Equivalence Katsumi Inoue National Institute of Informatics Chiaki Sakama Wakayama University MBR
Knowledge Repn. & Reasoning Lecture #9: Propositional Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2005.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
SCIENTIFIC METHOD NATURE OF SCIENCE AND EXPERIMENTAL DESIGN VANCE
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Goal-directed Execution of Answer Set Programs
BIO 1A – Unit 1 Mr. Hanczyc.
Resolution in the Propositional Calculus
1 Department of Engineering, 2 Department of Mathematics,
Probabilistic Horn abduction and Bayesian Networks
1 Department of Engineering, 2 Department of Mathematics,
Science vocabulary (12) 8/22/18 quiz
Science of Biology
1 Department of Engineering, 2 Department of Mathematics,
Back to “Serious” Topics…
What processes do scientists use when they perform scientific investigations? Chapter Introduction.
Automated Reasoning in Propositional Logic
1.3 Classifying Engineering Tasks
Representations & Reasoning Systems (RRS) (2.2)
The tool of doing an experiment
Presentation transcript:

Inference of Gene Relations from Microarray Data by Abduction Irene Papatheodorou & Marek Sergot Imperial College, London UK

Outline Gene Regulation & Microarrays Abductive Logic Programming Proof Procedure Model of Gene Interactions Applications & Tests Evaluation & Further Work

Gene Regulation External Stimulus Cell Response Gene Regulation: ABC Microarrays measure gene expression Gene Expression: DNA/gene mRNA Protein

Microarray Experiment AA BB Experiment: gene mutation/environmental stress Measures levels of gene expression

Expression Data to Gene Relations Mycobacterium tuberculosis experiments from CMMI Genomic Information-Background Knowledge Gene Relations- inhibits/induces Inference Method: Abduction

Deduction model of how genes work (in general) Organism A gene X regulates gene Y gene U inhibits gene V : observed gene expression + Infer the effect from rules

Abduction model of how genes work (in general) Organism A gene X regulates gene Y gene U inhibits gene V : observed gene expression + Inference from effect to cause

Abductive Inference Theory represented by (P, A, I) –P is a logic program –A is a set of abducible predicates-Do not occur in head of any clause in P –I Integrity Constraints, logic rules

Abductive Explanation Given an abductive logic theory (P, A, I), an abductive explanation for a query Q is a set Δ of ground abducible atoms on the predicates A such that: P ∪ Δ |= LP Q P ∪ Δ is consistent P ∪ Δ |= LP I. |= LP denotes some standard logical entailment relation of logic programming

Kakas-Mancarella Procedure Extension of basic resolution used in SLD SLDNF for ordinary logic programs Assumptions: Negative Literals, Abducibles Abductive Derivation: Adds abducible atoms encountered to assumptions in hypothesis Consistency Derivation: Checks consistency of hypothesis. Implementation: Alpha (R. Craven)

Gene Interaction Model Rules & Integrity Constraints of Gene Interactions Observables: increases_expression(Expt, Gene) reduces_expression(Expt, Gene) Abducibles: induces(GeneA, GeneB) inhibits(GeneA, GeneB)

The Rules (Summary) GENE 1GENE 2 Knocked out in expt E Increased expression in expt E INHIBITS* *Unless GENE 2 affected by another gene or GENE 2 affected by environmental stress Recursive rules 2 Parameters

The Model Concept of gene interaction increases_expression(Expt, X) ← knocks_out(Expt, G), inhibits(G,X).

The Model: Exceptions Top-level: Base case rule increases_expression(Expt, X) ← knocks_out(Expt, G), inhibits(G,X), not affected_by_other_gene(Expt, G, X), not affected_by_EnvFactor(Expt, X).

Rules of Gene Interaction Top-level recursive rule: increases_expression(Expt, X) ← knocks_out(Expt, G), candidate_gene(Expt,G1,G), reduces_expression(Expt,G1), inhibits(G,X), not affected_by_EnvFactor(Expt, X). Parameter: candidate_gene/3

Rules of Gene Interaction affected_by_other_gene(Expt,G,X) ← increases_expression(Expt,Gx), Gx  X, Gx  G, related_genes(Gx, G), induces(Gx, X). Parameter: related_genes/2

The Parameters “Related Genes” & “Intermediate Genes” Focus search on different sets of genes Transcription factors Similar Function

Integrity Constraints Self-consistency: False: induces(G1,G2), inhibits(G1,G2). Consistency with prior knowledge: False: induces(a,G). False: induces(G1,X), induces(G2,X), same_operon(G1,G2). Experimental Consistency: False: candidate_gene(E,G1,G2), mutates(E,G2), not affects(E,G1).

M.tuberculosis: 1 Observation Observation: increases_expression(hspR, ‘Rv0350’) Hypothesis: Hyp = [inhibits(‘Rv0353’, ‘Rv0350’)] –‘Rv0353’ is mutated in hspR –‘Rv0350’ is not affected by Environmental Factor –‘Rv0350’ is not affected by other gene

M.tuberculosis: 2 Hypotheses Observation: reduces_expression(sigH, ‘Rv2710’) Hypotheses: Hyp = [induces(‘Rv3223c’, ‘Rv2710’)] Hyp = [induces(‘Rv3223c’, ‘Rv1221’), induces(‘Rv1221’, ‘Rv2710’)]

M.tuberculosis: Regulators

Evaluation General Method for Microarray Analysis Simple and Flexible Model Enables comparison of experiments Reduces Time of Analysis

Future Work Directions Integrate output with pathway information Investigate different methods of formulating the problem Improve Performance of Abductive Interpreters

Summary Gene Regulation & Microarrays Visualising Experiments Abductive Model for Gene Interactions Applications Future Work

Questions? Irene Papatheodorou