Automating Biological Processes using Programming Languages and Algorithms Instructor: Doug Densmore Assisted By: Anne Von Devender Matthew Johnson Nade.

Slides:



Advertisements
Similar presentations
A8 – Control Structures if, if-else, switch Control of flow in Java Any sort of complex program must have some ability to control flow.
Advertisements

Franklin Township Elementary School Career Day: Computer Science
Algorithm and Complexity Analysis
1 CS101 Introduction to Computing Lecture 17 Algorithms II.
Chapter 1: An Overview of Computers and Programming Languages
Computing Convex Hulls CLRS 33.3
Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the five essential properties of an algorithm.
Faculty of Sciences and Social Sciences HOPE Java: Loops within loops Stewart Blakeway FML 213
General Computer Science for Engineers CISC 106 Lecture 19 Dr. John Cavazos Computer and Information Sciences 04/06/2009.
Program Design and Development
Chapter 2 The Algorithmic Foundations of Computer Science
CHAPTER 10 Recursion. 2 Recursive Thinking Recursion is a programming technique in which a method can call itself to solve a problem A recursive definition.
Chapter 2: Algorithm Discovery and Design
ECE122 L9: While loops March 1, 2007 ECE 122 Engineering Problem Solving with Java Lecture 9 While Loops.
ROBOT Computer and its Programs
Programming: Simple Control Structures Alice. Control Statements We have been using Do in order and Do together to control the way instructions are executed.
C++ Programming: From Problem Analysis to Program Design, Fifth Edition Chapter 1: An Overview of Computers and Programming Languages Updated by: Dr\Ali-Alnajjar.
Prof. Todd Neller Gettysburg College
CS161 Topic #21 CS161 Introduction to Computer Science Topic #2.
计算机科学概述 Introduction to Computer Science 陆嘉恒 中国人民大学 信息学院
Invitation to Computer Science 6th Edition
Goals of Course Introduction to the programming language C Learn how to program Learn ‘good’ programming practices.
CHAPTER 1: INTRODUCTION TO COMPUTER SCIENCE Introduction to Computer Science Using Ruby (c) 2012 Ophir Frieder et al.
About the Presentations The presentations cover the objectives found in the opening of each chapter. All chapter objectives are listed in the beginning.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
5 BASIC CONCEPTS OF ANY PROGRAMMING LANGUAGE Let’s get started …
Introduction to Algorithms. What is Computer Science? Computer Science is the study of computers (??) This leaves aside the theoretical work in CS, which.
ALGORITHM CHAPTER 8. Chapter Outlines and Objectives  Define an algorithm and relate it to problem solving.  Define three construct and describe their.
Problem Solving using the Science of Computing MSE 2400 EaLiCaRA Spring 2015 Dr. Tom Way.
CSE 501N Fall ‘09 12: Recursion and Recursive Algorithms 8 October 2009 Nick Leidenfrost.
About the Presentations The presentations cover the objectives found in the opening of each chapter. All chapter objectives are listed in the beginning.
© 2011 Pearson Education, publishing as Addison-Wesley Chapter 8: Recursion Presentation slides for Java Software Solutions for AP* Computer Science 3rd.
Programming: Simple Control Structures
Kaifeng Chen Institute for Theoretical Physics Synthetic Biology with Engineering Tools 1 Francis Chen.
Chapter 10 Algorithmic Thinking. Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the.
How the Session Works Outline Practical on arrival Talk 1 Reflect on practical Clarify concepts Practical exercises at your own pace Talk 2: Further concepts.
8.1 8 Algorithms Foundations of Computer Science  Cengage Learning.
Invitation to Computer Science 5 th Edition Chapter 2 The Algorithmic Foundations of Computer Science.
Programming: Simple Control Structures Sec 46 Web Design.
Compsci 06/101, Spring Compsci 6: PFTW l Problem solving and (Python) programming  What are the steps in solving an APT?  How do you get better.
Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.
PYTHON WHILE LOOPS. What you know While something is true, repeat your action(s) Example: While you are not facing a wall, walk forward While you are.
How Computers Solve Problems Computers also use Algorithms to solve problems, and change data into information Computers can only perform one simple step.
1 ©2006 INSciTE Lab Three Task: Move forward for 2 feet, turn right 90º repeat to complete a square path. End up exactly where you started.
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
Basic Concepts: computer, program, programming …
Chapter 1: An Overview of Computers and Programming Languages
Programming: Simple Control Structures
Data Structures and Algorithms
Arab Open University 2nd Semester, M301 Unit 5
Chapter 1: An Overview of Computers and Programming Languages
Creativity in Algorithms
Transition to Code Upsorn Praphamontripong CS 1110
Algorithm and Ambiguity
Computational Thinking
Transition to Code Upsorn Praphamontripong CS 1111
Prof. Todd Neller Gettysburg College
Chapter 1: An Overview of Computers and Programming Languages
Programming: Simple Control Structures
Algorithm and Ambiguity
Chapter 1: An Overview of Computers and Programming Languages
Franklin Township Elementary School Career Day: Computer Science
Flowcharts and Pseudo Code
Introduction to Computer Science
Principles of Computing – UFCFA Week 1
Introduction to Computer Science
Lecture 3 Pseudocode (S&G, §2.2)
Python While Loops.
Lesson Objective: I will be able to …
Presentation transcript:

Automating Biological Processes using Programming Languages and Algorithms Instructor: Doug Densmore Assisted By: Anne Von Devender Matthew Johnson Nade Sritanyaratana Presented by: Kevin Madrigal Kim Banford Selina Villanueva

Outline: Synthetic Biology Computer Aided Design (CAD) Objective Approach Algorithm Computer language

Synthetic Biology What is it? An area of research that combines Biology and Engineering Example of Synthetic Biology: -Lysophonics

Computer Aided Design (CAD) What is Computer Aided Design? -The use of computers in designing tools and other projects. Why is it important? -Design tools virtually on a computer -Make products at a lower cost -Edit your project or program more easily than by hand

Our Objective Create a program that a tool will use to automate a biological process using engineering and computer science.

Our Approach 1. Create an algorithm for a program to perform a simple process (a vacuuming robot) 2. Our vacuuming concept was translated to a similar biological process 3. We translated from “English” into Python (A programming language)

Algorithms A set of rules for solving a problem in a finite number of steps English translation: A set of rules or directions used to solve a problem (with a definite ending)

Our Algorithm-Vacuum version 1. Turn it on (Boolean) 2. Set dimensions of room (input value) While Loop 1. Walk forward (Boolean) 2. If walk forward return false, turn left 3. If walk forward return true, walk forward again

Programming Languages Languages comprehended by computers for programming Different kinds (e.g. Java, C, C+, and Oracle) We used Python make the program for our tool

Pipetting Robot Demonstration O O O O O

Pipetting Robot Demonstration O O O O X O O O O O

Pipetting Robot Demonstration O O O X X O O O O O

Pipetting Robot Demonstration O O X X X O O O O O

Pipetting Robot Demonstration O X X X X O O O O O

Pipetting Robot Demonstration X X X X X O O O O O

Pipetting Robot Demonstration X X X X X X O O O O O O O O O

Pipetting Robot Demonstration X X X X X X O O O O O O O O O

Pipetting Robot Demonstration X X X X X X O O O O O O O O O

Pipetting Robot Demonstration X X X X X X O O O O

Pipetting Robot Demonstration X X X X X X O O O O X X O O O

Pipetting Robot Demonstration X X X X X X O O O O X X X O O

Pipetting Robot Demonstration X X X X X X O O O O X X X X O

Pipetting Robot Demonstration X X X X X X O O O O X X X X X

Pipetting Robot Demonstration X X X X X X O O O O X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X O O O O X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X O O X X X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X O X X X X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X X O O X X O O O X X X X X X

Pipetting Robot Demonstration X X X X X X X O O X X X X X X

Pipetting Robot Demonstration X X X X X X X O O X X X X O X X X X X X

Pipetting Robot Demonstration X X X X X X X O O X X X X X X

Pipetting Robot Demonstration X X X X X X X O X X X X X X X

Pipetting Robot Demonstration X X X X X

Explanation In the robot demonstration, the robot travels in spirals until it gets to the last tube(O). For the robot to know where it is going, it needs to have some sort of an equation behind it. It counts the number of tubes it has to go to get to the end of the rack then subtracts the number of spirals to it. This results in the spiraling effect closing in every time it goes around.

Pipetting Robot Demonstration O O O O X O O O O O

Thanks for listening Any Questions?