Biochemistry, computing in biology 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History.

Slides:



Advertisements
Similar presentations
Meiosis and Sexual Life Cycles
Advertisements

Evolution of genomes.
Integrating Genomes D. R. Zerbino, B. Paten, D. Haussler Science 336, 179 (2012) Teacher: Professor Chao, Kun-Mao Speaker: Ho, Bin-Shenq June 4, 2012.
Recognizing the significance of meiosis to sexual reproduction
Phylogenetic reconstruction
Duplication, rearrangement, and mutation of DNA contribute to genome evolution Chapter 21, Section 5.
13-2 Manipulating DNA.
August 19, 2002Slide 1 Bioinformatics at Virginia Tech David Bevan (BCHM) Lenwood S. Heath (CS) Ruth Grene (PPWS) Layne Watson (CS) Chris North (CS) Naren.
Molecular Evolution Revised 29/12/06
. Class 1: Introduction. The Tree of Life Source: Alberts et al.
Introduction to the Cell Cycle and Inheritance
Computational Molecular Biology (Spring’03) Chitta Baral Professor of Computer Science & Engg.
13 Basics of Genetic Algorithms and some possibilities Peter Spijker Technische Universiteit Eindhoven Department of Biomedical Engineering Division of.
Human Genome Project. Basic Strategy How to determine the sequence of the roughly 3 billion base pairs of the human genome. Started in Various side.
Introduction to Biological Sequences. Background: What is DNA? Deoxyribonucleic acid Blueprint that carries genetic information from one generation to.
Sequencing a genome and Basic Sequence Alignment
Meiosis and genetic variation
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
Chapter 2 Genes Encode RNAs and Polypeptides
HerrickLab Jon SegerKevin WilliamsTom DoakDavid Witherspoon I. Understanding de novo telomere formation in Oxytricha macronuclear development by analyses.
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
Joost N. Kok Artificial Intelligence: from Computer Science to Molecular Informatics.
Todd J. Treangen, Steven L. Salzberg
Biology 10.2 Gene Regulation and Structure Gene Regulation and Structure.
CISC667, S07, Lec5, Liao CISC 667 Intro to Bioinformatics (Spring 2007) Pairwise sequence alignment Needleman-Wunsch (global alignment)
1 Computing with DNA L. Adelman, Scientific American, pp (Aug 1998) Note: This ppt file is based on a student presentation given in October, 1999.
Eukaryotic Gene Control. Developmental pathways of multicellular organisms: All cells of a multicellular organism start with the same complement of DNA.
Chapter Meiosis and Genetic Variation
Genome Organization and Evolution. Assignment For 2/24/04 Read: Lesk, Chapter 2 Exercises 2.1, 2.5, 2.7, p 110 Problem 2.2, p 112 Weblems 2.4, 2.7, pp.
Genomics Lecture 8 By Ms. Shumaila Azam. 2 Genome Evolution “Genomes are more than instruction books for building and maintaining an organism; they also.
Genomes and Their Evolution. GenomicsThe study of whole sets of genes and their interactions. Bioinformatics The use of computer modeling and computational.
Bioinformatics 2011 Molecular Evolution Revised 29/12/06.
The Organization of Cellular Genome Asmarinah Department of Medical Biology.
Molecular Computing and Evolution In Vitro Evolution In Vitro Clustering Genetic Algorithms Artificial Immune Systems Biological Evolution and Molecular.
1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems.
Sequencing a genome and Basic Sequence Alignment
Ch. 21 Genomes and their Evolution. New approaches have accelerated the pace of genome sequencing The human genome project began in 1990, using a three-stage.
Genomes & their evolution Ch 21.4,5. About 1.2% of the human genome is protein coding exons. In 9/2012, in papers in Nature, the ENCODE group has produced.
1 TRANSCRIPTION AND TRANSLATION. 2 Central Dogma of Gene Expression.
Chapter 21 Eukaryotic Genome Sequences
Chapter 3 The Biological Basis of Life. Chapter Outline  The Cell  DNA Structure  DNA Replication  Protein Synthesis.
Outline for today’s lecture (Ch. 13)
Eukaryotic Genomes  The Organization and Control of Eukaryotic Genomes.
Copyright © 2008 Pearson Education, Inc., publishing as Pearson Benjamin Cummings PowerPoint ® Lecture Presentations for Biology Eighth Edition Neil Campbell.
DNA computing on a chip Mitsunori Ogihara and Animesh Ray Nature, 2000 발표자 : 임예니.
Chapter 6 Section 1 Chromosomes.
Theory of computing, part 4. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of.
A study in creating sex cells Meiosis KM1 Genome Genome: Complete complement of an organism’s DNA. Includes genes (control traits) and non-coding DNA.
Bellringer Why is genetic diversity beneficial to populations? How does sexual reproduction increase genetic diversity? How does meiosis increase genetic.
LECTURE PRESENTATIONS For CAMPBELL BIOLOGY, NINTH EDITION Jane B. Reece, Lisa A. Urry, Michael L. Cain, Steven A. Wasserman, Peter V. Minorsky, Robert.
Retroviruses and Trans(retro)posons
The diagram below represents early stages of embryo development.
Chapter 13 Meiosis.
Introduction to Bioinformatics Resources for DNA Barcoding
Human Genome Project.
Sunday, Tuesday & Thursday 2-3
Genomes and Their Evolution
Genomes and Their Evolution
SGN23 The Organization of the Human Genome
DNA/RNA Genetic Engineering Evolution
Basics of Genetic Algorithms (MidTerm – only in RED material)
Genome organization and Bioinformatics
A Brief History What is molecular biology?
Genomes on the Edge: Programmed Genome Instability in Ciliates
Theory of computing, part 4
Gene Density and Noncoding DNA
T. Harju, I. Petre, and G. Rozenberg
Basics of Genetic Algorithms
Meiosis and genetic variation
Meiosis and genetic variation
Presentation transcript:

Biochemistry, computing in biology

1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems 6P systems 7Hairpins 8Detection techniques 9Micro technology introduction 10Microchips and fluidics 11Self assembly 12Regulatory networks 13Molecular motors 14DNA nanowires 15Protein computers 16DNA computing - summery 17Presentation of essay and discussion Course outline

Recombination

Recombination and crossover

If no exchange of genes (i.e. phenotypic marker) occurs, recombination event can not be detected Recombination and crossover

Introduction to ciliates

literature  Genome Gymnastics: Unique Modes of DNA Evolution and Processing in Ciliates. David M. Prescott, Nature Reviews Genetics  Computational power of gene rearrangement. Lila Kari and Laura Landweber, DIMACS series in discreet mathematics and theoretical computer science

 Very ancient ( ~ years ago)  Very rich group ( ~ genetically different organisms)  Very important from the evolutionary point of view The ciliate

 DNA molecules in micronucleus are very long (hundreds of kilo bps)  DNA molecules in macronucleus are gene- size, short (average ~ 2000 bps) The ciliate

Baldauf et al Science 290:972. The ciliate tree

Urostyla grandis Bar: 50  m Holosticha kessleri Bar: 100  m Uroleptus sp. Bar: 100  m Scrambled Genes Found S. lemnae O. trifallax O. nova Eschaneustyla sp. Bar: 25  m

The ciliate

Dapi staining of the ciliate

Nuclei  Micronucleus the small nucleus containing a single copy of the genome that is used for sexual reproduction  Macronucleus the large nucleus that carries up to several hundred copies of the genome and controls metabolism and asexual reproduction

Prescott, 2000 Macronucleus Micronucleus Cutting, splicing, elimination, reordering, and amplification of DNA Lifecycle of a ciliate

The ciliate, meiosis

Cell Pairing Meiosis and Nuclear Exchange Nuclear Fusion and Duplication of the Zygotic Nucleus Macronuclear Development and Nuclear Degeneration MIC MAC Modified from Larry Klobutcher & Carolyn Jahn Ann. Review Microbiology, 2002 Polytenization Chromatid breakage De novo telomere formation The ciliate, reproduction

Computing in ciliates

Astounding feats of ‘DNA computing’ are routine in this ‘simple’ single -celled organism— a protozoan. In initial micronucleus, DNA is‘junky’ and scrambled, but…. ….it reassembles itself in proper sequence by means of computer-like acrobatics (unscrambling, throwing out genetic ‘junk’)—in macronucleus The ciliate

IES: internal eliminated segments MDS: macronuclear destined sequences MAC MIC TelomerePointers The complexity of spirotrich biology

Splicing

Fractioned genes

 Intervening non-coding DNA regions (IES: internal eliminated segments) interrupt protein-coding sequences (MDS macronuclear destined sequences)  IESs are removed during macronuclear development  MDSs are unscrambled Prescott, 2000 The complexity of gene scrambling

Actin I DNA polymerase  Landweber et al., 2000 Hogan et al., 2001  -TBP Prescott et al., 1998 Oxytricha nova Scramble genes  -TBP, actin I, DNA pol 

Prescott et al, 1998 Degree of scrambling in  -TBP

Hogan et al, 2001 Unscrambling of actin I

Landweber et al, 2000 Degree of scrambling in DNA pol 

DNA folding and recombination DNA pol 

DNA folding and recombination

DNA pol  : Hairpin loop Prescott, 2000 DNA folding and recombination DNA pol 

Prescott et al, 1998 Recombination  -TBP

(i)Isolate the micronuclear and macronuclear forms of the  -TBP gene (ii)Compare the micronuclear and macronuclear gene structures (MDS and IESs) to determine whether the gene is scrambled (iii)Compare homologous MDSs and scrambling patterns in various stichotrich species (earlier diverging species vs later diverging species) (iv)Trace a parsimonious evolutionary scrambling pathway Tracing evolutionary scrambling

Uroleptus sp. Oxytrichidae and Paraurostyla weissei Comparisons of scrambling complexity

Oxytricha trifallax Oxytricha nova Stylonychia mytilus Uroleptus sp. Paraurostyla weissei 100 The evolution of recombination

P. weissei Uroleptus sp. Holosticha sp. O. trifallax O. nova S. mytilus Evolutionary scrambling pathway

Formal theory

Ciliate computing  The process of gene unscrambling in hypotrichous ciliates represents one of nature’s ingenious solutions to the computational problem of gene assembly.  With some essential genes fragmented in as many as 50 pieces, these organisms rely on a set of sequence and structural clues to detangle their coding regions.  For example, pointer sequences present at the junctions between coding and non-coding sequences permit reassembly of the functional copy. As the process of gene unscrambling appears to follow a precise algorithm or set of algorithms, the question remains: what is the actual problem being solved?

 Genomic Copies of some Protein-coding genes are obscured by intervening non- protein-coding DNA sequence elements (internally eliminated sequences, IES)  Protein-coding sequences (macronuclear destined sequences, MDS) are present in a permuted order, and must be rearranged. The problem in the cell

 By clever structural alignment…, the cell decides which sequences are IES and MDS, as well as which are guides.  After this decision, the process is simply sorting, O(n).  Decision process unknown, but amounts to finding the correct path. Most Costly. Assumption

 there is some as yet undiscovered “oracle”mechanism within the cell,  or the cell simulates non-determinism  the former solution lacks biological credibility and the latter implies exponential time and space explosion.  What we want is a deterministic algorithm for applying the inter- and intra- molecular recombination operations to descramble an arbitrary gene. Ciliate computing

The first proposed step in gene unscrambling— alignment or combinatorial pattern matching— may involve searches through several possible matches, via either intra-molecular or intermolecular strand associations. This part could be similar to Adleman’s (1994) DNA solution of a directed Hamiltonian path problem. Ciliate computing

The second step—homologous recombination at aligned repeats—involves the choice of whether to retain the coding or the non-coding segment between each pair of recombination junctions. This decision process could even be equivalent to solving an n-bit instance of a satisfiability problem, where n is the number of scrambled segments. Ciliate computing

We use our knowledge of the first step to develop a model for the guided homologous recombinations and prove that such a model has the computational power of a Turing machine, the accepted formal model of computation. This indicates that, in principle, these unicellular organisms may have the capacity to perform at least any computation carried out by an electronic computer. Ciliate computing

 Assume the cell simply reconstructs the genes by matching up pointers.  Just one problem... pointer sequences are not unique. In fact, may have multiplicities greater than 13.  The proposed solution to this was that the cell would simply try every possible combination of pointers until it found the right two. Ciliate computing, the naïve model

 Relies on short repeat sequences to act as guides in homologous recombination events  Splints analogous to edges in Adleman  One example represents solution of 50 city HP (50 pieces reordered) How the cell computes

 Guided recombination system Formal model

 Context necessary for a re- combination between repeats x (p, x, q) ~ (p’, x, q’) Formal model

 Formal Language Model Where u=u’p, w=qw’=w’’p’, v=q’v’  Intramolecular recombination. The guide is x. Delete x wx from original.  Intermolecuar recombination. Strand Exchange.  This is a universal Turing machine (proven by Tom Head) Formal model, splicing operation

Gene unscrambling algorithm

Ciliate computing

 Micronucleus: cell mating  Macronucleus: RNA transcripts (expression)  Micro: I 0 M 1 I 1 M 2 I 2 M 3 … I k M k I k+1  M = P 1 N P 2  Macro: permutation of (possibly rotated) M 1,…, M k and I 0,…, I k+1 are removed Gene assembly in ciliates

Molecular operators

 The pointer sequences must be in spatial proximity during unscrambling  Topology must be faithfully reproduced somehow Pointers

 Recombination event attaches Minor Locus to end of Major Locus Relocation of a locus