Cyclopeptide Sequencing Problem

Slides:



Advertisements
Similar presentations
Functional Programming Lecture 10 - type checking.
Advertisements

CSE-700 Parallel Programming Assignment 6 POSTECH Oct 19, 2007 박성우.
Sequences of Real Numbers An Introduction. What is a sequence? Informally A sequence is an infinite list. In this class we will consider only sequences.
Designing Algorithms Csci 107 Lecture 4. Outline Last time Computing 1+2+…+n Adding 2 n-digit numbers Today: More algorithms Sequential search Variations.
CSC 2300 Data Structures & Algorithms March 27, 2007 Chapter 7. Sorting.
Program Design and Development
Flowcharts Remember that a solution to a problem is called an algorithm. Algorithms are often a series of steps required to solve the problem. A flowchart.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 4- 1.
Designing Algorithms Csci 107 Lecture 4.
Week 2: Greedy Algorithms
Algorithms. Introduction Before writing a program: –Have a thorough understanding of the problem –Carefully plan an approach for solving it While writing.
Orgad Keller Modified by Ariel Rosenfeld Less Than Matching.
Type Inference: CIS Seminar, 11/3/2009 Type inference: Inside the Type Checker. A presentation by: Daniel Tuck.
Introduction to Methods. How do we use Methods in Java? Let us start by creating one which displays “hello” on Dos Prompt.
1/20 Symbolic Execution and Program Testing Charngki PSWLAB Symbolic Execution and Program Testing James C.King IBM Thomas J.Watson Research Center.
CS1020E Sitin 1 Discussion -- Counting Palindromes.
PROTEIN STRUCTURE NAME: ANUSHA. INTRODUCTION Frederick Sanger was awarded his first Nobel Prize for determining the amino acid sequence of insulin, the.
Introduction to Computational Linguistics Programming I.
Programming Fundamentals. Today’s lecture Decisions If else …… Switch Conditional Operators Logical Operators.
Turing Machines – Decidability Lecture 25 Section 3.1 Fri, Oct 19, 2007.
A step-by-step procedure for solving a problem in a finite number of steps.
1 Example: Solution of Quadratic Equations We want to solve for real values of x, for given values of a, b, and c. The value of x can be determined from.
CIS* Quiz 2. For a large array, and in the worst case, selection sort is faster than insertion sort. False Both selection sort and insertion sort.
CS242.  Reduce Complexity  Introduce an intermediate, understandable abstraction  Avoid code duplication  Support subclassing  Hide sequences  Hide.
BEGINNING PROGRAMMING.  Literally – giving instructions to a computer so that it does what you want  Practically – using a programming language (such.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
Chapter Making Decisions 4. Relational Operators 4.1.
CHAPTER 5 MAKING DECISION Hidayah Elias BFC2042 – Computer Programming.
Copyright 2003 Scott/Jones Publishing Standard Version of Starting Out with C++, 4th Edition Chapter 4 Making Decisions.
Advanced Strings Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg 1.
Lecture 7: Menus and getting input. switch Multiple-selection Statement switch Useful when a variable or expression is tested for all the values it can.
1 CSC103: Introduction to Computer and Programming Lecture No 16.
Searching CSE 103 Lecture 20 Wednesday, October 16, 2002 prepared by Doug Hogan.
Sum of Arithmetic Sequences. Definitions Sequence Series.
Data Structures Arrays and Lists Part 2 More List Operations.
Recursion. Objectives At the conclusion of this lesson, students should be able to Explain what recursion is Design and write functions that use recursion.
ISA Kim Hye mi. Introduction Input Spectrum data (Protein database) Peptide assignment Peptide validation manual validation PeptideProphet.
CompSci Today’s Topics Computer Science Noncomputability Upcoming Special Topic: Enabled by Computer -- Decoding the Human Genome Reading Great.
(Proof By) Induction Recursion
C++ Memory Management – Homework Exercises
8.1 Determine whether the following statements are correct or not
Patterns, Subsets, Properties Expressions & Equations Literal
Multiplication
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
Repetition (While-Loop) version]
Chapter 4: Making Decisions.
Introduction to Programming
Multiplication
Chapter 4: Making Decisions.
10.6 Shell Sort: A Better Insertion
Cyclopeptide Sequencing
Subroutines Idea: useful code can be saved and re-used, with different data values Example: Our function to find the largest element of an array might.
Computers & Programming Languages
Algorithms + Data Structures = Programs -Niklaus Wirth
Topic 1: Problem Solving
Problem Solving Designing Algorithms.
Solving One and Two Step Equations
Sequencing Cyclic Peptides
Programming Concepts and Database
4-9问题的形式化描述.
For First Place Most Times Up at the Table
Introduction to Computer Science
Agenda Warmup Lesson 1.9 (random #s, Boolean variables, etc)
Decidability continued….
Lec 21 More Fun with Arrays: For Loops
Given a list of n  8 integers, what is the runtime bound on the optimal algorithm that sorts the first eight? O(1) O(log n) O(n) O(n log n) O(n2)
COMPUTING.
Agenda Warmup Lesson 1.9 (random #s, Boolean variables, etc)
Presentation transcript:

Cyclopeptide Sequencing Problem By Camille Hendry

The problem Reconstructing a cyclic peptide from masses taken out of a mass spectrometer We have mass of all twenty peptides Use the branch and bound method to solve

Assuming we have an ideal spectrum

If we do not have an ideal spectrum

Data Taken From Cyclopepeptide sequencing Input: 0 113 128 186 241 299 314 427 Output: 186-128-113, 186-113-128, 128-186-113, 128-113-186, 113-186-128 113- 128-186 Leaderboardpeptide sequencing Input: 10 (N) 0 71 113 129 147 200 218 260 313 331 347 389 460 Output: 113-147-71-129

High Order Steps- cyclopeptide sequencing spectrum input an ideal Spectrum (list of integers) output all possible peptide strings in a list Total mass of a peptide function input of peptide (list of masses) outputs total mass. Expand function Which add to the list of total peptides (Branch step) The input is the current peptide list doesn’t return anything, but instead modify the peptide list that was inputted. A consistent function Checks to see if the peptide is consistent with spectrum (Bound step) input a peptide (list of mass) and a spectrum Outputted True or False

High Order Steps- Leadership cyclopeptide sequencing spectrum Inputs an ideal Spectrum (list of integers) and a N (the highest score, with ties) Ideal spectrum function Inputs a peptide (string) Outputs a spectrum (list) Score function Compares the experimental spectrum to the ideal spectrum and gives a score based on number of values that match Inputs are peptide (list of masses) and spectrum(list). Outputs a score (integer).

Conclusion Each function one step closer Leadership still not prefect Due to time saving nature of algorithm you could get rid of best possibility But In practice it works pretty well