On Template Method for DNA Sequence Design

Slides:



Advertisements
Similar presentations
Convolutional Codes Representation and Encoding  Many known codes can be modified by an extra code symbol or by deleting a symbol * Can create codes of.
Advertisements

Hamming Code.
Hierarchical DNA Memory based on Nested PCR Satoshi Kashiwamura, Masahito Yamamoto, Atsushi Kameda, Toshikazu Shiba and Azuma Ohuchi, 8th International.
Correcting Errors Beyond the Guruswami-Sudan Radius Farzad Parvaresh & Alexander Vardy Presented by Efrat Bank.
Selection of Optimal DNA Oligos for Gene Expression Arrays Reporter : Wei-Ting Liu Date : Nov
Theoretical Computer Science COMP 335 Fall 2004
Hamming Code Rachel Ah Chuen. Basic concepts Networks must be able to transfer data from one device to another with complete accuracy. Data can be corrupted.
DNA Computing: implementation of data flow logical operations P. Wasieqicz, A. Malinowski, R. Nowak, J.J. Mulawka, P. Borsuk, P. Weglenski, and A. Plucienniczak.
Strand Design for Biomolecular Computation
Hierarchical DNA Memory based on Nested PCR Satoshi Kashiwamura, Masahito Yamamoto, Atsushi Kameda, Toshikazu Shiba, Azuma Ohuchi.
Is DNA Computing Viable for 3-SAT Problems? Dafa Li Theoretical Computer Science, vol. 290, no. 3, pp , January Cho, Dong-Yeon.
Precomputing Edit-Distance Specificity of Short Oligonucleotides Nathan Edwards Center for Bioinformatics and Computational Biology University of Maryland,
Wireless Mobile Communication and Transmission Lab. Theory and Technology of Error Control Coding Chapter 5 Turbo Code.
Biomolecular Computation in Virtual Test Tubes 7 th International Meeting on DNA Based Computers, p75-83, June 10-13, 2001 Max Garzon, Chris Oehmen Summarized.
Strings and Languages CS 130: Theory of Computation HMU textbook, Chapter 1 (Sec 1.5)
Chapter 31 INTRODUCTION TO ALGEBRAIC CODING THEORY.
A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, Summarized by Shin, Soo-Yong.
Computer Communication & Networks Lecture 10 Datalink Layer: Error Correction Waleed Ejaz
Error Detection and Correction
Error-Detecting and Error-Correcting Codes
1 Digital Design Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
Binary Arithmetic for DNA Computers R. Barua and J. Misra Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, pp ,
(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo.
PUNCH: An Evolutionary Algorithm for Optimizing Bit Set Selection Adam J. Ruben, Stephen J. Freeland, Laura F. Landweber DNA7, 2001 Summarized by Dongmin.
Molecular Computation and Splicing Systems J.H.M. Dassen, Summarized by Dongmin Kim
Learning Kernel Classifiers 1. Introduction Summarized by In-Hee Lee.
Computer Architecture Error Correcting Codes Ralph Grishman Oct (Text pp and B-65-67) NYU.
Introduction Why do we study Theory of Computation ?
Some simple basics. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field.
DNASequenceGenerator: A Program for the construction of DNA sequences Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe DNA7 pp Summarized.
Practical Session 10 Computer Architecture and Assembly Language.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Updated by J.-H. Eom (2 nd round revision) Summarized by K.-I.
Stochastic Local Search Algorithms for DNA word Design Dan C Tulpan, Holger H Hoos, and Anne Condon Summerized by Ji-Eun Yun.
Chapter 9. The PlayMate System ( 2/2 ) in Cognitive Systems Monographs. Rüdiger Dillmann et al. Course: Robots Learning from Humans Summarized by Nan Changjun.
CSCI2950-C Genomes, Networks, and Cancer
Chair Professor Chin-Chen Chang Feng Chia University Jan. 2008
Distributed Compression For Still Images
Computer Architecture and Assembly Language
Summarized by In-Hee Lee
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants Z. Frank Qiu and Mi Lu Third Workshop on Bio-Inspired Solutions to Parallel Processing.
Subject Name: Information Theory Coding Subject Code: 10EC55
PNA-mediated Whiplash PCR
Horn Clause Computation with DNA Molecules
Fuzzy logic with biomolecules
DNA Library Design for Molecular Computation
Summarized by In-Hee Lee
Gene expression profiling diagnosis through DNA molecular computation
Information Redundancy Fault Tolerant Computing
A.R. Hurson 323 CS Building, Missouri S&T
Subhayu Basu et al. , DNA8, (2002) MEC Seminar Su Dong Kim
Horn Clause Computation by Self-Assembly of DNA Molecules
Some Thoughts on Theorem Proving
Fitness measures for DNA Computing
Information Theoretical Probe Selection for Hybridisation Experiments
Operation of a Purified DNA nanoactuator
Chapter 5 Language Change: A Preliminary Model (2/2)
Computer Architecture and Assembly Language
Molecular Genetic Programming
Russell Deaton, junghuei Chen, hong Bi, and John A. Rose
tUAN THANH NGUYEN Nanyang Technological University (NTU), Singapore
Bioinformatics, Vol.17 Suppl.1 (ISMB 2001)
Nearest-neighbor model for Tm
Lecture 17 Making New Codes from Old Codes (Section 4.6)
Lecture 15 The Minimum Distance of a Code (Section 4.4)
Communication Theory as Applied to Wireless Sensor Networks
Designs for Autonomous Unidirectional Walking DNA Devices
Universal Biochip Readout of Directed Hamiltonian Path Problems
Chair Professor Chin-Chen Chang Feng Chia University Jan. 2008
Lecture 18 The Main Coding Theory Problem (Section 4.7)
Terminology and Symbols
Presentation transcript:

On Template Method for DNA Sequence Design Satoshi Kobayashi, Tomohiro Kondo. DNA8, Summarized by Dongmin Kim, 2002. 8.

© 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/ Introduction The design of DNA sequences is an important problem. Not only in DNA computing but also in other biotechnologies such as the design of DNA chips. The design of DNA sequence is dependent on the protocol of biological experiments. Template method The position of [GC] and [AT] are fixed for all sequences. The position of [AG] and [CT] are determined for each sequence using the theory of error correcting code. © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

© 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/ Template Method (1) Alphabet is a word on the alphabet. lg(x) denotes the length n of x. <x> denotes the proper subword of x of length n-2. H(x,y) denotes the Hamming distance. H(S) is the minimum Hamming distance among all pairs of distinct elements in S. © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

© 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/ Template Method (2) n<=m, HM(x,y) = min{H(x,y’) | y’ is a subword of y of length n}. Constraints Hamming distance – should be at least a given integer d. Hamming distance with reverse-complement. Hamming distance between concatenated words. GC content © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

© 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/ Template Method (3) Problem 1 For a given positive integer d and n, design a set S of n words over such that and GC content of each word in S is the same to each other. © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

© 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/ Template Method (4) © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

DNA Sequence Design Using AG-Templates (1) © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

DNA Sequence Design Using AG-Templates (2) © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

Using Multiple Templates (1) © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

Using Multiple Templates (2) © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

© 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/ Conclusions Extend the template method. AG-templates instead of GC-templates show a better performance at some lengths. Propose to use multiple templates method. Future works The stability of structures should be dealt with using energy based methods. The validity of template method should be checked by biological experiments. Further theoretical analysis should be done in a more general framework. © 2002, SNU BioIntelligence Lab, http://bi.snu.ac.kr/