A Software Tool for Generating Non-Crosshybridizing libraries of DNA Oligonucleotides Russell Deaton, junghuei Chen, hong Bi, and John A. Rose Summerized.

Slides:



Advertisements
Similar presentations
In Silico Primer Design and Simulation for Targeted High Throughput Sequencing I519 – FALL 2010 Adam Thomas, Kanishka Jain, Tulip Nandu.
Advertisements

Reconstruction of DNA sequencing by hybridization Ji-Hong Zhang, Ling-Yun Wu and Xiang-Sun Zhang Institute of Applied Mathematics,
Mining Compressed Frequent- Pattern Sets Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng Department of Computer Science University of Illinois at Urbana-Champaign.
DNA Computation and Circuit Construction Isabel Vogt 2012.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
1 DNA Computation: The Secret of Life as Non-Living Technology Russell Deaton Professor Comp. Science & Engineering The University of Arkansas Fayetteville,
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
Predicting RNA Structure and Function. Non coding DNA (98.5% human genome) Intergenic Repetitive elements Promoters Introns mRNA untranslated region (UTR)
Genome Scale PCR Infidelity Search Goal: An efficient search for the presence of potential undesired PCR products that scans through 3 billion bases of.
Introduction to Bioinformatics - Tutorial no. 9 RNA Secondary Structure Prediction.
Selection of Optimal DNA Oligos for Gene Expression Arrays Reporter : Wei-Ting Liu Date : Nov
Implementation of Planted Motif Search Algorithms PMS1 and PMS2 Clifford Locke BioGrid REU, Summer 2008 Department of Computer Science and Engineering.
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays Nazif Cihan Tas CMSC 838 Presentation.
DNA Computing: Mathematics with Molecules Russell Deaton Professor Comp. Sci. & Engr. The University of Arkansas Fayetteville, AR 72701
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
©2003/04 Alessandro Bogliolo Primer design. ©2003/04 Alessandro Bogliolo Outline 1.Polymerase Chain Reaction 2.Primer design.
Whole genome alignments Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas
Radial Basis Function Networks
PCR Primer Design Guidelines
Efficient Gathering of Correlated Data in Sensor Networks
Network Aware Resource Allocation in Distributed Clouds.
Strand Design for Biomolecular Computation
Content of the previous class Introduction The evolutionary basis of sequence alignment The Modular Nature of proteins.
Efficient Data Mining for Calling Path Patterns in GSM Networks Information Systems, accepted 5 December 2002 SPEAKER: YAO-TE WANG ( 王耀德 )
Position Reconstruction in Miniature Detector Using a Multilayer Perceptron By Adam Levine.
The Fidelity of the Tag-Antitag System J. A. Rose, R. J. Deaton, M. Hagiya, And A. Suyama DNA7 poster Summarized by Shin, Soo-Yong.
Identification of Regulatory Binding Sites Using Minimum Spanning Trees Pacific Symposium on Biocomputing, pp , 2003 Reporter: Chu-Ting Tseng Advisor:
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
From Structure to Function. Given a protein structure can we predict the function of a protein when we do not have a known homolog in the database ?
USING FREE GEOCHEMICAL SOFTWARE FROM THE U.S. GEOLOGICAL SURVEY DEVIN CASTENDYK STATE UNIVERSITY OF NEW YORK, ONEONTA
An Empirical Study of Choosing Efficient Discriminative Seeds for Oligonucleotide Design Won-Hyong Chung and Seong-Bae Park Dept. of Computer Engineering.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Design of oligonucleotides for microarrays and perspectives for design of multi-transcriptome arrays Henrik Bjorn Nielsen, Rasmus Wernersson and Steen.
September Bound Computation for Adaptive Systems V&V Giampiero Campa September 2008 West Virginia University.
DNA Computing in Microreactors Danny van Noort, Frank-Ulich Gast and John S. McCaskill Biomolecular Information Processing, GMD, Germany Lee Ji Youn.
A PCR-based Protocol for In Vitro Selection of Non-Crosshybridizing Oligonucleotides R. Deaton, J. Chen, H. Bi, M. Garzon, H. Rubin and D. H. Wood.
Improving Intergenic miRNA Target Genes Prediction Rikky Wenang Purbojati.
Copyright © Cengage Learning. All rights reserved. 12 Analysis of Variance.
Implicit Hitting Set Problems Richard M. Karp Erick Moreno Centeno DIMACS 20 th Anniversary.
Section Copyright © 2014, 2012, 2010 Pearson Education, Inc. Chapter 10 Correlation and Regression 10-2 Correlation 10-3 Regression.
1 Random Disambiguation Paths Al Aksakalli In Collaboration with Carey Priebe & Donniell Fishkind Department of Applied Mathematics and Statistics Johns.
PCR The polymerase chain reaction. Crick and Watson – structure of DNA.
TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean*
R ANDOM N UMBER G ENERATORS Modeling and Simulation CS
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Introduction to NP Instructor: Neelima Gupta 1.
CSE280Stefano/Hossein Project: Primer design for cancer genomics.
Another Realization of Aqueous Computing with Peptide Nucleic Acid August 8, 2001 Park, Ji-Yoon Masayuki Yamamura, Yusuke Hiroto, and Taku Matoba.
Learning Hidden Graphs Hung-Lin Fu 傅 恆 霖 Department of Applied Mathematics Hsin-Chu Chiao Tung Univerity.
Components Of A Typical PCR Reaction Mix PCR Reaction Buffer (usually supplied at 10X) 100mM Tris-HCl - Essentially a pH Buffer. Maintains appropriate.
DNASequenceGenerator: A Program for the construction of DNA sequences Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe DNA7 pp Summarized.
PCR TECHNIQUE
Summarized by In-Hee Lee
Computability and Complexity
PNA-mediated Whiplash PCR
Autumn 2015 Lecture 11 Minimum Spanning Trees (Part II)
Fuzzy logic with biomolecules
DNA Library Design for Molecular Computation
Introduction to Bioinformatics II
CSE 589 Applied Algorithms Spring 1999
Fitness measures for DNA Computing
Russell Deaton, junghuei Chen, hong Bi, and John A. Rose
DNA Solution of the Maximal Clique Problem
Approximation Algorithms for the Selection of Robust Tag SNPs
Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)
Molecular Basis for Target RNA Recognition and Cleavage by Human RISC
Bioinformatics, Vol.17 Suppl.1 (ISMB 2001)
Fragment Assembly 7/30/2019.
Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)
Presentation transcript:

A Software Tool for Generating Non-Crosshybridizing libraries of DNA Oligonucleotides Russell Deaton, junghuei Chen, hong Bi, and John A. Rose Summerized by Ji-Eun, Yun

Abstract(1) Vertices : Individual oligonucleotides or Watson- Crick pairs Edge : Indicating a hybridization The problem of finding a library of non-crosshybridizing DNA oligonucleotides DNA oligonucleotides Finding an independent set of vertices in a graph.

Abstract(2) The minimum free energy of hybridization, according to the nearest-neighbor model of duplex thermal stability,is less than some threshold value. Using this equivalence, an algorithm is implemented to find maximal libraries.

Introduction(1) DNAC key operation : the template-matching hybridization reaction. Unplanned hybridization can occur Several negative effects. DWD several requirements. as designed.  The selected oligonucleotides should hybridize only as designed. large  The set of words, or library, should be large enough to represent the problem and implement a solution. small collections of oligonucleotides.  Most of previous work : small collections of oligonucleotides.

Introduction(2) The ongoing work goal  To use computer simulation to study the characteristics of very large collections of many different DNA oligonucleotides.  A DWD tool was implemented  1. Ability to simulate and generate large sets of non- crosshybridizing oligonucleotides  basis in nearest-neighbor model of DNA thermal stability,  capability to check sequences and their reverse complements  Options for different reaction conditions (temperature, salt starand concentrations, output of free energies of hybridization, melting temperatures and alignments of most energetically stable duplex.)

Outline 1. The equivalence of the DWD problem and the ISET 2. A software tool is described that implements the suggested algorithms. 3. The method and result are discussed, and conclusionts given.

DWD Equivalence to ISET(1) The DNA word design problem ( the problem of finding a maimum-sized library of non- crosshybidizing DNA word) may be expressed as follows: Difinition 1(DWD)  Given a set of DNA oligonucleotides, an hybridization energy a positive integer, and a threshold, does T contain a subset such that

DWD Equivalence to ISET(2) Definition 2(ISET)  Given a graph G = (V,E) and a positive integer, dose G contain a subset such that, and such that no two vertice in are joined by an edge in E

DWD Equivalence to ISET(3) Greedy Algorithm  Let T' represent the noncrosshybridizing library, and N(T') indicate all those oligonucleotide.  The algorithm for an initial set of oligonucleotides of size m is shown Begin T '  0 for i = 1 to m do if i  N( T ')then T '  T '  {i} end

DWD Equivalence to ISET(4) In the Implementation  Large random sets of oligonucleotides and their Watson-Crick complements are generated.  Oligonucleotide are chosen in order and added to the library if they are still available.  All oligonucleotides that have an minimum energy of hybridization with the added sequence, or its complement, that are less than threshold. By repeating this process, a non-crosshybridizing library can be selected from the original random population

Thermodynamic Calculations(1) the nearest-neighbor model of duplex thermal stability The pgm uses the nearest-neighbor model of duplex thermal stability to determine gybridization evergies between oligonucleotides. Hybridization are determined between two oligonucleotides if their minimum free energy of formation is less than a user-defined threshold.

Thermodynamic Calculations(2) The minimum free energy of hybridization is computed using a variant of the Smith-Waterman dynamic programming for finding local alignments. The scoring function

Thermodynamic Calculations(4) Value of enthalpy are recorded for melting temperature calculations

Results(1) 1. A set of template molecules to test a PCR protocol to select maximally mismatched DNA oligonucleotieds

Results(2)

Discussion(1) A maximal non-crosshybridizing library, not the largest possible. The algorithm is fairly efficient and has generated a library of 3953 non-crosshybridizing Watson-Crick pairs of length 20bp. In the thermodynamics, only the minimum free energy of hybridization is computed between two oligonucleotides.  Minimum free energy was sufficiently small -> p(h) also be small  many binding modes of approximately equal energy -> significant p(cross h)

Discussion(2) The threshold for hybridization is set by the user  Because, the size of the library generated is highly dependent on the threshold. The duplexes generated by the tool were consistent with a modified staggered zipper model. (local dynamic pgmming method produced single duplex region that contained very few error.) but to supply a speedy design tool for large libraries of DNA words for computation. The goal of the tool is not a complete thermodynamic simulator, but to supply a speedy design tool for large libraries of DNA words for computation.

Conclusion(1) A software tool for generating non- crosshybridizing oligonucleotides has been developed and tested. The minimum free energy for duplex formation between two given oligonucleotide is calculated using a unified set of nearest-neighbor thermodynamic parameters A dynamic pgmming algorithm that calculates the minimum energy over all possible local alignment of two oligonucleotides.

Conclusion(2) The libraries are selected from a initial random population by applying a greedy algorithm. The tool was also used to generate non- crosshybridizing libraries for 10-mer and 20-mer.