Projects CSE280A. Project 1: Primer design for fused transcripts Filled primers represent selection from the candidate pool. Edges indicate dimerization.

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

You will learn about: Complex Numbers Operations with complex numbers Complex conjugates and division Complex solutions of quadratic equations Why: The.
Solving Quadratic Equations by Factoring
Combinatorial Algorithms for Haplotype Inference Pure Parsimony Dan Gusfield.
Line Search.
The Evolution of File Carving Presenters: Muhammad Mohsin Butt(g ) COE589 Paper Presentation.
© 2005 Prentice Hall6-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
Ladders, Couches, and Envelopes An old technique gives a new approach to an old problem Dan Kalman American University Fall 2007.
Functions.
MIT and James Orlin © Nonlinear Programming Theory.
Primer Selection Methods for Detection of Genomic Inversions and Deletions via PAMP Bhaskar DasGupta, University of Illinois at Chicago Jin Jun, and Ion.
Deployment of Surface Gateways for Underwater Wireless Sensor Networks Saleh Ibrahim Advising Committee Prof. Reda Ammar Prof. Jun-Hong Cui Prof. Sanguthevar.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Sequencing and Sequence Alignment
Lecture 5: Learning models using EM
Support Vector Machines for Multiple- Instance Learning Authors: Andrews, S.; Tsochantaridis, I. & Hofmann, T. (Advances in Neural Information Processing.
Aligning Alignments Exactly John Kececioglu and Dean Starrett Proceedings of the eighth annual international conference on Computational molecular biology.
Protein Domain Finding Problem Olga Russakovsky, Eugene Fratkin, Phuong Minh Tu, Serafim Batzoglou Algorithm Step 1: Creating a graph of k-mers First,
Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.
Nth Root and Rational Exponents Section 7.1. WHAT YOU WILL LEARN: 1.How to evaluate nth roots of real numbers using both radical notation and rational.
Easy Optimization Problems, Relaxation, Local Processing for a small subset of variables.
CPSC 411, Fall 2008: Set 4 1 CPSC 411 Design and Analysis of Algorithms Set 4: Greedy Algorithms Prof. Jennifer Welch Fall 2008.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Many quadratic equations can not be solved by factoring. Other techniques are required to solve them. 7.1 – Completing the Square x 2 = 20 5x =
7.1 – Completing the Square
Graphical Solutions Plot all constraints including nonnegativity ones
ICBV Course Final Project Arik Krol Aviad Pinkovezky.
Genome closure and finishing. Clone walking Already sequenced Unsequenced primer locations tgcatgatcgtgatcat acgtactagcactagtactgtagtcgatgcactgatcgatcgatcgatgctacgatgcatgct...
Partial Product (Multiplication Algorithm)
An elementary investigation of the p = 4k – 1 asymmetry theorem for quadratic residues by Jim Adams.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
PE-Assembler: De novo assembler using short paired-end reads Pramila Nuwantha Ariyaratne.
Vocabulary. Rational Number Most numbers are rational. It is a number whose decimal expansion eventually terminates or repeats. – What does it mean to.
Rational/Theoretical Cognitive Task Analysis Ken Koedinger Key reading: Zhu, X., & Simon, H. A. (1987). Learning mathematics from examples and by doing.
Copyright © Cengage Learning. All rights reserved.
Do Now: Factor x2 – 196 4x2 + 38x x2 – 36 (x + 14)(x – 14)
Algorithms and Running Time Algorithm: Well defined and finite sequence of steps to solve a well defined problem. Eg.,, Sequence of steps to multiply two.
Combinatorial Optimization Problems in Computational Biology Ion Mandoiu CSE Department.
COT 6930 HPC and Bioinformatics Multiple Sequence Alignment Xingquan Zhu Dept. of Computer Science and Engineering.
UNIT 2 LESSON 6 CS PRINCIPLES. UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem.
Clase 3: Basic Concepts of Search. Problems: SAT, TSP. Tarea 1 Computación Evolutiva Gabriela Ochoa
Quadratic Functions (4) What is the discriminant What is the discriminant Using the discriminant Using the discriminant.
Notes Over 5.6 Quadratic Formula
4.8 “The Quadratic Formula” Steps: 1.Get the equation in the correct form. 2.Identify a, b, & c. 3.Plug numbers into the formula. 4.Solve, then simplify.
Curve Fitting Introduction Least-Squares Regression Linear Regression Polynomial Regression Multiple Linear Regression Today’s class Numerical Methods.
Machine Learning in Practice Lecture 10 Carolyn Penstein Rosé Language Technologies Institute/ Human-Computer Interaction Institute.
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Introduction to PCR Polymerase Chain Reaction
CSE280Stefano/Hossein Project: Primer design for cancer genomics.
1 Combinatorial Problem. 2 Graph Partition Undirected graph G=(V,E) V=V1  V2, V1  V2=  minimize the number of edges connect V1 and V2.
QUADRATIC FUNCTIONS AND EQUATIONS Ch. 4.7 The Quadratic Formula EQ: HOW CAN YOU SOLVE QUADRATIC EQUATIONS BY USING THE QUADRATIC FORMULA? I WILL SOLVE.
PCR Polymerase Chain Reaction PCR Polymerase Chain Reaction Marie Černá, Markéta Čimburová, Marianna Romžová.
Introduction to PCR Polymerase Chain Reaction
Solver & Optimization Problems
C++ Basic Syntax – Homework Exercises
Solve more difficult number problems mentally
Partial Products Algorithm for Multiplication
How LINGO diagnoses solution issues
Use the properties of Real Numbers to justify each step when solving the following equation:
Exam 2 LZW not on syllabus. 73% / 75%.
Quadratics Multiply out (x+16) (x-16) (x+12) (x-12) = ?
Opener Perform the indicated operation.
How What’sBest! diagnoses solution issues
Warm Up Solve for x:
Supplemental Figure 3 A B C T-DNA 1 2 RGLG1 2329bp 3 T-DNA 1 2 RGLG2
Chapter 1. Formulations.
Presentation transcript:

Projects CSE280A

Project 1: Primer design for fused transcripts Filled primers represent selection from the candidate pool. Edges indicate dimerization. All possible sums F i +R j give the possible lengths, and each length should be distinct. Forward exons F1 F2 R1

Project 1: goals All successful primer products should have distinct lengths Formulate the problem Solve on multiple real instances Project report should discuss feasibility

Project 2: Primer multiplexing for large regions Forward Reverse

Project 2 goals We need to get as many breakpoints as possible while minimizing the number of reactions Formulate the problem Solve on multiple real instances Project report should discuss feasibility. Are there creative ways of doing the design so that the quadratic expansion is reduced. Are ‘alternating designs’ better than ‘segmented designs’. Can we prove this.

Project 3: Fixation time A a Time = f(N,s)? N 1+s

Project 3 goals We have two manuscript with slightly different calculations. Reconcile, or say which one is correct Justify the theory in these two papers with extensive simulations over a variety of N and s values Provide a theory that best fits the data (optional).

Note Fixation time

Project 4: Selection in the post-fixation regime

Post-fixation

Project 5 goals There is a big gap between what is possible with a specific model and what is achieved with a general model. Try different ML based techniques to get an improvement in the post-fixation regime. Note that it is not easy to identify post-fixation so this is not sufficient, but it will provide insight.

Project 5 Introgressed sequences

Project 5 goals Discuss the techniques used in this paper and another (Reich Nature), and try to replicate the results. This is more open ended, but it doesn’t require algorithmic thinking.