CBC Computing with Biology & Chemistry MSc Natural Computation Department of Computer Science Universiy of York.

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

DNA Computing with Logic Gates. Traditional Logic Gates An XOR Gate Implementation:
NEU Neural Computing MSc Natural Computation Department of Computer Science University of York.
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
June 6, Using Negative Edge Triggered FFs to Reduce Glitching Power in FPGA Circuits Tomasz S. Czajkowski and Stephen D. Brown Department of Electrical.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.
1 Introduction to Computability Theory Lecture11: Variants of Turing Machines Prof. Amos Israeli.
Phillip Senum University of Minnesota. Motivation Much effort has been spent developing techniques for analyzing existing chemical systems. Comparatively.
1 Lecture 4 Topics –Problem solving Subroutine Theme –REC language class The class of solvable problems Closure properties.
4/27/2006 ELEC7250: White 1 ELEC7250 VLSI Testing: Final Project Andrew White.
Lecture 14 Go over midterm results Algorithms Efficiency More on prime numbers.
1 Regular expression matching with input compression : a hardware design for use within network intrusion detection systems Department of Computer Science.
Digital Logic Design Lecture 24. Announcements Homework 8 due today Exam 3 on Tuesday, 11/25. – Topics for exam are up on the course webpage.
Data Structures Lecture-1:Introduction
Programming and Coding short course consultation.
Class 6_1 Today’s topic: More on engineering analysis and modeling Your “computer modeling” assignment.
Introduction to Computer and Programming CS-101 Lecture 6 By : Lecturer : Omer Salih Dawood Department of Computer Science College of Arts and Science.
Prof. dr Slobodanka Đorđević-Kajan Dr Dragan Stojanović
CS492: Special Topics on Distributed Algorithms and Systems Fall 2008 Lab 3: Final Term Project.
Overview of Computing. Computer Science What is computer science? The systematic study of computing systems and computation. Contains theories for understanding.
Switch off your Mobiles Phones or Change Profile to Silent Mode.
CS654: Digital Image Analysis Lecture 3: Data Structure for Image Analysis.
Functions Math 123 September 24-26, Another boring topic? Functions are one of the mathematical concepts that students understand the least. Why.
G52IVG, School of Computer Science, University of Nottingham 1 Administrivia Timetable Lectures, Friday 14:00 – 16:00 Labs, Friday 17:00 -18:00 Assessment.
Discrete Structures for Computing
Tutor: Prof. Lucia Pomello Supervisors: Prof. Giancarlo Mauri Dr. Luciano Milanesi PhD Thesis Proposal Membrane systems: a framework for stochastic processes.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.1 Introduction to the Module.
Computational Thinking
Systems Biology ___ Toward System-level Understanding of Biological Systems Hou-Haifeng.
Lecture 11 Data Structures, Algorithms & Complexity Introduction Dr Kevin Casey BSc, MSc, PhD GRIFFITH COLLEGE DUBLIN.
An Investigation into Implementations of DNA Sequence Pattern Matching Algorithms Peden Nichols Computer Systems Research April,
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
1 Structure of Aalborg University Welcome to Aalborg University.
Computer Science 210 Computer Organization Course Introduction.
ELE 523E COMPUTATIONAL NANOELECTRONICS
Kaifeng Chen Institute for Theoretical Physics Synthetic Biology with Engineering Tools 1 Francis Chen.
Project / Thesis Seminar Young Suk Moon Department of Computer Science Rochester Institute of Technology.
Algorithms & Data Structures (M) 2013–14 Prof David A Watt Moodle: Computing Science → Algorithms & Data Structures (IT) © 2008 David A Watt, University.
Sayed Ahmad Salehi Marc D. Riedel Keshab K. Parhi University of Minnesota, USA Markov Chain Computations using Molecular Reactions 1.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
Unit1: Modeling & Simulation Module5: Logic Simulation Topic: Unknown Logic Value.
Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, Xingping Su and Lloyd M. Smith Presented by Je-Keun.
Neural Networks Si Wu Dept. of Informatics PEV III 5c7 Spring 2008.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Common Elements in Sequential Design. Lecture 3 topics  Registers and Register Transfer  Shift Registers  Counters Basic Counter Partial sequence counters.
Logic Design (CE1111 ) Lecture 6 (Chapter 6) Registers &Counters Prepared by Dr. Lamiaa Elshenawy 1.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Design and Analysis of Algorithms Faculty Name : Ruhi Fatima Course Description This course provides techniques to prove.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
BMTS Computer Programming Pre-requisites :BMTS 242 –Computer and Systems Nature Of the Course: Programming course, contain such as C, C++, Database.
Postgraduate stud. Al-Ahnomi Montaser Don State Technical University Department “Computer-aided design" Theme:- "development and research of intelligent.
© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1 UML Activity Diagrams.
CSIS 104 –Intro. To Computer Science
Year 9 Subject Selection Chemistry
Year 10 Subject Selection Chemistry
Year 11 Subject Selection Chemistry
Principles of Computing – UFCFA Lecture-1
Introduction to Soft Computing
Intelligent Information System Lab
NDA Coaching in Chandigarh
Year 9 Subject Selection Genetics
ELE 523E COMPUTATIONAL NANOELECTRONICS
DNA Hybridization Catalysts and Catalyst Circuits
MSc in Statistical Science Graduate Open Day – 31 October 2018
Confronting 500 Years of Separation:
Principles of Computing – UFCFA Week 1
Example: Verification
Computer Science 210 Computer Organization
Presentation transcript:

CBC Computing with Biology & Chemistry MSc Natural Computation Department of Computer Science Universiy of York

Module description To give a foundation in computational systems that are inspired by biological and chemical systems, or that are themselves bio-chemical systems,  or that include a bio-chemical part as an essential constituent. This goes from well-understood areas like DNA computing to less mature areas like reaction-diffusion computers, P-systems, H-systems … Unifying theme is their differences from conventional computational systems, both in the approach taken to the computation and to the physical substrate used for the computation.

Who is it aimed at? Basic computer science experience of algorithms and complexity will be assumed No biological/chemical background will be necessary – but we will cover some genetics and chemistry very quickly, so be prepared to read a lot!

Level of mathematics required Ability to follow formal definitions of machines But this is not essential for very much of the module Basic complexity theory Some statistics/probability

Content 1: DNA Computing Starting point is the use of biological macromolecules for computing How do we represent data? How do we manipulate it? Is it efficient? Image from

CATATAGGCAATATCCGTAG V 1,left V 1,right V 2,left V 2,right E x,left =Vc 1,right E x,right = Vc 2,left V 1,left V 1,right Representing data structures Each node represented by a 20-mer strand Each possible edge represented by a complementary 20-mer

Content 2: Complex systems

GRN

Content 3: RD systems Complex chemical reactions don ’ t always behave as expected …

Chemical logic gates: 3 input OR gate Controlled inputs are xyz 1-input ( “ clock ” ) is required to get output in the 000 case (shown) Graph shows response to three patterns (000, 111 and 010). In the latter two cases, there is a single intensity peak in the output. Gradually increasing response is due to “ ageing ” of the system Much more complicated functions can be implemented …

Practical elements As yet, no lab work with DAN or chemical systems There will be seminars Discussions on topics from the module based around a specified piece of reading Other possibilities include Simulation of DNA systems Analysis of complex dynamic systems (GRNs) Use of P-system simulators

Assessment The assessment for the module is open The assessment will consist of some or all of the following: Demonstration of understanding of lecture material Selection and application of algorithms to given datasets Analysis of the output of specific algorithms Review of the literature on a particular topic.