# Hidden Markov Models in Bioinformatics. By Máthé Zoltán Kőrösi Zoltán 2006

Save this PDF as:

Size: px
Start display at page:

Download "Hidden Markov Models in Bioinformatics. By Máthé Zoltán Kőrösi Zoltán 2006"

## Transcription

1 Hidden Markov Models in Bioinformatics By Máthé Zoltán Kőrösi Zoltán 2006

2 Outline Markov Chain HMM (Hidden Markov Model) Hidden Markov Models in Bioinformatics Gene Finding Gene Finding Model Viterbi algorithm HMM Advantages HMM Disadvantages Conclusions

3 Markov Chain Definition: A Markov chain is a triplet (Q, {p(x 1 = s)}, A), where: Q is a finite set of states. Each state corresponds to a symbol in the alphabet p is the initial state probabilities. A is the state transition probabilities, denoted by a st for each s, t Q. For each s, t Q the transition probability is: a st P(x i = t x i-1 = s) Output: The output of the model is the set of states at each instant time => the set of states are observable Property: The probability of each symbol x i depends only on the value of the preceding symbol x i-1 : P (x i x i-1,, x 1 ) = P (x i x i-1 )

4 Example of a Markov Model

5 HMM (Hidden Markov Model Definition: An HMM is a 5-tuple (Q, V, p, A, E), where: Q is a finite set of states, Q =N V is a finite set of observation symbols per state, V =M p is the initial state probabilities. A is the state transition probabilities, denoted by a st for each s, t Q. For each s, t Q the transition probability is: a st P(x i = t x i-1 = s) E is a probability emission matrix, e sk P (v k at time t q t = s) Output: Only emitted symbols are observable by the system but not the underlying random walk between states -> hidden

6 Example of a Hidden Markov Model

7 The HMMs can be applied efficently to well known biological problems. That why HMMs gained popularity in bioinformatics, and are used for a variety of biological problems like: protein secondary structure recognition multiple sequence alignment gene finding

8 What HMMs do? A HMM is a statistical model for sequences of discrete simbols. Hmms are used for many years in speech recognition. HMMs are perfect for the gene finding task. Categorizing nucleotids within a genomic sequence can be interpreted as a clasification problem with a set of ordered observations that posses hidden structure, that is a suitable problem for the application of hidden Markov models.

9 Hidden Markov Models in Bioinformatics The most challenging and interesting problems in computational biology at the moment is finding genes in DNA sequences. With so many genomes being sequenced so rapidly, it remains important to begin by identifying genes computationally.

10 Gene Finding Gene finding refers to identifying stretches of nucleotide sequences in genomic DNA that are biologically functional. Computational gene finding deals with algorithmically identifying protein-coding genes. Gene finding is not an easy task, as gene structure can be very complex.

11 Objective: Motivation: To find the coding and non-coding regions of an unlabeled string of DNA nucleotides Assist in the annotation of genomic data produced by genome sequencing methods Gain insight into the mechanisms involved in transcription, splicing and other processes

12 Structure of a gene

13 The gene is discontinous, coding both: exons (a region that encodes a sequence of amino acids). introns (non-coding polynucleotide sequences that interrupts the coding sequences, the exons, of a gene).

14

15 In gene finding there are some important biological rules: Translation starts with a start codon (ATG). Translation ends with a stop codon (TAG, TGA, TAA). Exon can never follow an exon without an intron in between. Complete genes can never end with an intron.

16 Gene Finding Models When using HMMs first we have to specify a model. When choosing the model we have to take into consideration their complexity by: The number of states and allowed transitions. How sophisticated the learning methods are. The learning time.

17 The Model consists of a finite set of states, each of which can emit a symbol from a finite alphabet with a fixed probability distribution over those symbols, and a set of transitions between states, which allow the model to change state after each symbol is emitted. The models can have different complexity, and different built in biological knowledge.

18 The model for the Viterbi algorithm

19 states = ('Begin', 'Exon', 'Donor', 'Intron') observations = ('A', 'C', 'G', 'T')

20 The Model Probabilities Transition probability: transition_probability = { 'Begin' : {'Begin' : 0.0, 'Exon' : 1.0, 'Donor' : 0.0, 'Intron' : 0.0}, 'Exon' : {'Begin' : 0.0, 'Exon' : 0.9, 'Donor' : 0.1, 'Intron' : 0.0}, 'Donor' : {'Begin' : 0.0, 'Exon' : 0.0, 'Donor' : 0.0, 'Intron' : 1.0}, 'Intron' : {'Begin' : 0.0, 'Exon' : 0.0, 'Donor' : 0.0, 'Intron' : 1.0} }

21 Emission probability: emission_probability = { 'Begin' : {'A' :0.00, 'C' :0.00, 'G' :0.00, 'T' :0.00}, 'Exon' : {'A' :0.25, 'C' :0.25, 'G' :0.25, 'T' :0.25}, 'Donor' : {'A' :0.05, 'C' :0.00, 'G' :0.95, 'T' :0.00}, 'Intron' : {'A' :0.40, 'C' :0.10, 'G' :0.10, 'T' :0.40} }

22 Viterbi algorithm Dynamic programming algorithm for finding the most likely sequence of hidden states. The Vitebi algorithm finds the most probable path called the Viterbi path.

23 The main idea of the Viterbi algorithm is to find the most probable path for each intermediate state, until it reaches the end state. At each time only the most likely path leading to each state survives.

24 The steps of the Viterbi algorithm

25 The arguments of the Viterbi algorithm viterbi(observations, states, start_probability, transition_probability, emission_probability)

26 The working of the Viterbi algorithm The algorithm works on the mappings T and U. The algorithm calculates prob, v_path, and v_prob where prob is the total probability of all paths from the start to the current state, v_path is the Viterbi path, and v_prob is the probability of the Viterbi path, and The mapping T holds this information for a given point t in time, and the main loop constructs U, which holds similar information for time t+1.

27 The algorithm computes the triple (prob, v_path, v_prob) for each possible next state. The total probability of a given next state, total is obtained by adding up the probabilities of all paths reaching that state. More precisely, the algorithm iterates over all possible source states. For each source state, T holds the total probability of all paths to that state. This probability is then multiplied by the emission probability of the current observation and the transition probability from the source state to the next state. The resulting probability prob is then added to total.

28 For each source state, the probability of the Viterbi path to that state is known. This too is multiplied with the emission and transition probabilities and replaces valmax if it is greater than its current value. The Viterbi path itself is computed as the corresponding argmax of that maximization, by extending the Viterbi path that leads to the current state with the next state. The triple (prob, v_path, v_prob) computed in this fashion is stored in U and once U has been computed for all possible next states, it replaces T, thus ensuring that the loop invariant holds at the end of the iteration.

29 Example Input DNA sequence: CTTCATGTGAAAGCAGACGTAAGTCA Result: Total: e-17 the sum of all the calculated probabilities

30 Viterbi Path: ['Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Exon', 'Donor', 'Intron', 'Intron', 'Intron', 'Intron', 'Intron', 'Intron', 'I ntron', 'Intron'] Viterbi probability: e-18

31 HMM Advantages Statistics HMMs are very powerful modeling tools Statisticians are comfortable with the theory behind hidden Markov models Mathematical / theoretical analysis of the results and processes Modularity HMMs can be combined into larger HMMs

32 Transparency People can read the model and make sense of it The model itself can help increase understanding Prior Knowledge Incorporate prior knowledge into the architecture Initialize the model close to something believed to be correct Use prior knowledge to constrain training process

33 HMM Disadvantages State independence States are supposed to be independent, P(y) must be independent of P(x), and vice versa. This usually isn t true Can get around it when relationships are local Not good for RNA folding problems

34 Over-fitting You re only as good as your training set More training is not always good Local maximums Model may not converge to a truly optimal parameter set for a given training set Speed Almost everything one does in an HMM involves: enumerating all possible paths through the model Still slow in comparison to other methods

35 Conclusions HMMs have problems where they excel, and problems where they do not You should consider using one if: The problem can be phrased as classification The observations are ordered The observations follow some sort of grammatical structure If an HMM does not fit, there s all sorts of other methods to try: Neural Networks, Decision Trees have all been applied to Bioinformatics

36 Bibliography Pierre Baldi, Soren Brunak: The machine learning approach programming/donorsitemodel/index.html

37 Thank you.

### Hidden Markov Models for biological systems

Hidden Markov Models for biological systems 1 1 1 1 0 2 2 2 2 N N KN N b o 1 o 2 o 3 o T SS 2005 Heermann - Universität Heidelberg Seite 1 We would like to identify stretches of sequences that are actually

### Hidden Markov Models CBB 261 / CPS 261. part 1. B. Majoros

Hidden Markov Models part 1 CBB 261 / CPS 261 B. Majoros The short answer: it s an opaque, nondeterministic machine that emits variable-length sequences of discrete 1 symbols. push AGATATTATCCGATGCTACGCATCA

### Hidden Markov Models in Bioinformatics with Application to Gene Finding in Human DNA Machine Learning Project

Hidden Markov Models in Bioinformatics with Application to Gene Finding in Human DNA 308-761 Machine Learning Project Kaleigh Smith January 17, 2002 The goal of this paper is to review the theory of Hidden

### Bioinformatics Resources at a Glance

Bioinformatics Resources at a Glance A Note about FASTA Format There are MANY free bioinformatics tools available online. Bioinformaticists have developed a standard format for nucleotide and protein sequences

### Hidden Markov models in gene finding. Bioinformatics research group David R. Cheriton School of Computer Science University of Waterloo

Hidden Markov models in gene finding Broňa Brejová Bioinformatics research group David R. Cheriton School of Computer Science University of Waterloo 1 Topics for today What is gene finding (biological

### Gene Finding CMSC 423

Gene Finding CMSC 423 Finding Signals in DNA We just have a long string of A, C, G, Ts. How can we find the signals encoded in it? Suppose you encountered a language you didn t know. How would you decipher

### Algorithms in Computational Biology (236522) spring 2007 Lecture #1

Algorithms in Computational Biology (236522) spring 2007 Lecture #1 Lecturer: Shlomo Moran, Taub 639, tel 4363 Office hours: Tuesday 11:00-12:00/by appointment TA: Ilan Gronau, Taub 700, tel 4894 Office

### GenBank, Entrez, & FASTA

GenBank, Entrez, & FASTA Nucleotide Sequence Databases First generation GenBank is a representative example started as sort of a museum to preserve knowledge of a sequence from first discovery great repositories,

### Hidden Markov Models

8.47 Introduction to omputational Molecular Biology Lecture 7: November 4, 2004 Scribe: Han-Pang hiu Lecturer: Ross Lippert Editor: Russ ox Hidden Markov Models The G island phenomenon The nucleotide frequencies

### Gene Models & Bed format: What they represent.

GeneModels&Bedformat:Whattheyrepresent. Gene models are hypotheses about the structure of transcripts produced by a gene. Like all models, they may be correct, partly correct, or entirely wrong. Typically,

### Grammars and introduction to machine learning. Computers Playing Jeopardy! Course Stony Brook University

Grammars and introduction to machine learning Computers Playing Jeopardy! Course Stony Brook University Last class: grammars and parsing in Prolog Noun -> roller Verb thrills VP Verb NP S NP VP NP S VP

### Transcription Animations

Transcription Animations Name: Lew Ports Biology Place http://www.lewport.wnyric.org/jwanamaker/animations/protein%20synthesis%20-%20long.html Protein is the making of proteins from the information found

### Bioinformatics Grid - Enabled Tools For Biologists.

Bioinformatics Grid - Enabled Tools For Biologists. What is Grid-Enabled Tools (GET)? As number of data from the genomics and proteomics experiment increases. Problems arise for the current sequence analysis

### Overview of Eukaryotic Gene Prediction

Overview of Eukaryotic Gene Prediction CBB 231 / COMPSCI 261 W.H. Majoros What is DNA? Nucleus Chromosome Telomere Centromere Cell Telomere base pairs histones DNA (double helix) DNA is a Double Helix

### Bioinformatics: Network Analysis

Bioinformatics: Network Analysis Molecular Cell Biology: A Brief Review COMP 572 (BIOS 572 / BIOE 564) - Fall 2013 Luay Nakhleh, Rice University 1 The Tree of Life 2 Prokaryotic vs. Eukaryotic Cell Structure

### Comprehensive Examinations for the Program in Bioinformatics and Computational Biology

Comprehensive Examinations for the Program in Bioinformatics and Computational Biology The Comprehensive exams will be given once a year. The format will be six exams. Students must show competency on

### Lecture 10: Sequential Data Models

CSC2515 Fall 2007 Introduction to Machine Learning Lecture 10: Sequential Data Models 1 Example: sequential data Until now, considered data to be i.i.d. Turn attention to sequential data Time-series: stock

### Hidden Markov Models. Terminology and Basic Algorithms

Hidden Markov Models Terminology and Basic Algorithms Motivation We make predictions based on models of observed data (machine learning). A simple model is that observations are assumed to be independent

### Protein Synthesis How Genes Become Constituent Molecules

Protein Synthesis Protein Synthesis How Genes Become Constituent Molecules Mendel and The Idea of Gene What is a Chromosome? A chromosome is a molecule of DNA 50% 50% 1. True 2. False True False Protein

### Gene Finding and HMMs

6.096 Algorithms for Computational Biology Lecture 7 Gene Finding and HMMs Lecture 1 Lecture 2 Lecture 3 Lecture 4 Lecture 5 Lecture 6 Lecture 7 - Introduction - Hashing and BLAST - Combinatorial Motif

### Ingenious Genes Curriculum Links for AQA AS (7401) and A-Level Biology (7402)

Ingenious Genes Curriculum Links for AQA AS (7401) and A-Level Biology (7402) 3.1.1 Monomers and Polymers 3.1.4 Proteins 3.1.5 Nucleic acids are important information-carrying molecules 3.2.1 Cell structure

### Lecture 4: Exact string searching algorithms. Exact string search algorithms. Definitions. Exact string searching or matching

COSC 348: Computing for Bioinformatics Definitions A pattern (keyword) is an ordered sequence of symbols. Lecture 4: Exact string searching algorithms Lubica Benuskova http://www.cs.otago.ac.nz/cosc348/

### Introduction to Genome Annotation

Introduction to Genome Annotation AGCGTGGTAGCGCGAGTTTGCGAGCTAGCTAGGCTCCGGATGCGA CCAGCTTTGATAGATGAATATAGTGTGCGCGACTAGCTGTGTGTT GAATATATAGTGTGTCTCTCGATATGTAGTCTGGATCTAGTGTTG GTGTAGATGGAGATCGCGTAGCGTGGTAGCGCGAGTTTGCGAGCT

### Transcription & Translation. Part of Protein Synthesis

Transcription & Translation Part of Protein Synthesis Three processes Initiation Transcription Elongation Termination Initiation The RNA polymerase binds to the DNA molecule upstream of the gene at the

### Transcription and Translation of DNA

Transcription and Translation of DNA Genotype our genetic constitution ( makeup) is determined (controlled) by the sequence of bases in its genes Phenotype determined by the proteins synthesised when genes

### OUTCOMES. PROTEIN SYNTHESIS IB Biology Core Topic 3.5 Transcription and Translation OVERVIEW ANIMATION CONTEXT RIBONUCLEIC ACID (RNA)

OUTCOMES PROTEIN SYNTHESIS IB Biology Core Topic 3.5 Transcription and Translation 3.5.1 Compare the structure of RNA and DNA. 3.5.2 Outline DNA transcription in terms of the formation of an RNA strand

### Lecture/Recitation Topic SMA 5303 L1 Sampling and statistical distributions

SMA 50: Statistical Learning and Data Mining in Bioinformatics (also listed as 5.077: Statistical Learning and Data Mining ()) Spring Term (Feb May 200) Faculty: Professor Roy Welsch Wed 0 Feb 7:00-8:0

### Biological Sequence Data Formats

Biological Sequence Data Formats Here we present three standard formats in which biological sequence data (DNA, RNA and protein) can be stored and presented. Raw Sequence: Data without description. FASTA

### SAM Teacher s Guide DNA to Proteins

SAM Teacher s Guide DNA to Proteins Note: Answers to activity and homework questions are only included in the Teacher Guides available after registering for the SAM activities, and not in this sample version.

### Gene Prediction with a Hidden Markov Model

Gene Prediction with a Hidden Markov Model Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakultäten der Georg-August-Universität zu Göttingen vorgelegt von Mario

### CSE8393 Introduction to Bioinformatics Lecture 3: More problems, Global Alignment. DNA sequencing

SE8393 Introduction to Bioinformatics Lecture 3: More problems, Global lignment DN sequencing Recall that in biological experiments only relatively short segments of the DN can be investigated. To investigate

### Human Genome Sequencing Project: What Did We Learn? 02-223 How to Analyze Your Own Genome Fall 2013

Human Genome Sequencing Project: What Did We Learn? 02-223 How to Analyze Your Own Genome Fall 2013 Human Genome Sequencing Project Interna:onal Human Genome Sequencing Consor:um ( public project ) Ini\$al

### What s the Point? --- Point, Frameshift, Inversion, & Deletion Mutations

What s the Point? --- Point, Frameshift, Inversion, & Deletion Mutations http://members.cox.net/amgough/mutation_chromosome_translocation.gif Introduction: In biology, mutations are changes to the base

### Gene Finding. Slides by Carl Kingsford

Gene Finding Slides by Carl Kingsford Genome of the Cow a sequence of 2.86 billion letters enough letters to fill a million pages of a typical book. TATGGAGCCAGGTGCCTGGGGCAACAAGACTGTGGTCACTGAATTCATCCTTCTTGGTCTAACAGAGAACATAG

### SAM Teachers Guide Nucleic Acids and Proteins (Long Version) Overview Learning Objectives Possible Student Pre/Misconceptions

SAM Teachers Guide Nucleic Acids and Proteins (Long Version) Overview Students explore the structure and function of two of the four major macromolecules: proteins and nucleic acids. On the first day they

### Tagging with Hidden Markov Models

Tagging with Hidden Markov Models Michael Collins 1 Tagging Problems In many NLP problems, we would like to model pairs of sequences. Part-of-speech (POS) tagging is perhaps the earliest, and most famous,

### 14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)

Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,

### Unifying secondary-structure, fold-recognition, and new-fold methods for protein structure prediction

Unifying secondary-structure, fold-recognition, and new-fold methods for protein structure prediction Kevin Karplus, Rachel Karchin, Richard Hughey karplus@soe.ucsc.edu Center for Biomolecular Science

### RNA and Protein Synthesis Biology Mr. Hines

RNA and Protein Synthesis 12.3 Biology Mr. Hines Now we know how DNA (genes) are copied. But how is it used to make a living organism? Most of the structures inside of a cell are made of protein - so we

### Transcription Study Guide

Transcription Study Guide This study guide is a written version of the material you have seen presented in the transcription unit. The cell s DNA contains the instructions for carrying out the work of

### PROC. CAIRO INTERNATIONAL BIOMEDICAL ENGINEERING CONFERENCE 2006 1. E-mail: msm_eng@k-space.org

BIOINFTool: Bioinformatics and sequence data analysis in molecular biology using Matlab Mai S. Mabrouk 1, Marwa Hamdy 2, Marwa Mamdouh 2, Marwa Aboelfotoh 2,Yasser M. Kadah 2 1 Biomedical Engineering Department,

### The genetic code consists of a sequence of three letter "words" (called 'codons'), written one after another along the length of the DNA strand.

Review Questions Translation (protein synthesis) 1. What is the genetic code? The genetic code consists of a sequence of three letter "words" (called 'codons'), written one after another along the length

### Machine Learning I Week 14: Sequence Learning Introduction

Machine Learning I Week 14: Sequence Learning Introduction Alex Graves Technische Universität München 29. January 2009 Literature Pattern Recognition and Machine Learning Chapter 13: Sequential Data Christopher

### From DNA to Protein! (Transcription & Translation)! I. An Overview

Protein Synthesis! From DNA to Protein! (Transcription & Translation)! I. An Overview A. Certain sequences of nucleotides in DNA [called genes], can be expressed/used as a code to determine the sequence

### DNA and the Cell. Version 2.3. English version. ELLS European Learning Laboratory for the Life Sciences

DNA and the Cell Anastasios Koutsos Alexandra Manaia Julia Willingale-Theune Version 2.3 English version ELLS European Learning Laboratory for the Life Sciences Anastasios Koutsos, Alexandra Manaia and

### APPLICATION OF HIDDEN MARKOV CHAINS IN QUALITY CONTROL

INTERNATIONAL JOURNAL OF ELECTRONICS; MECHANICAL and MECHATRONICS ENGINEERING Vol.2 Num.4 pp.(353-360) APPLICATION OF HIDDEN MARKOV CHAINS IN QUALITY CONTROL Hanife DEMIRALP 1, Ehsan MOGHIMIHADJI 2 1 Department

### Genetic information (DNA) determines structure of proteins DNA RNA proteins cell structure 3.11 3.15 enzymes control cell chemistry ( metabolism )

Biology 1406 Exam 3 Notes Structure of DNA Ch. 10 Genetic information (DNA) determines structure of proteins DNA RNA proteins cell structure 3.11 3.15 enzymes control cell chemistry ( metabolism ) Proteins

### Data Mining Techniques and their Applications in Biological Databases

Data mining, a relatively young and interdisciplinary field of computer sciences, is the process of discovering new patterns from large data sets involving application of statistical methods, artificial

### Service courses for graduate students in degree programs other than the MS or PhD programs in Biostatistics.

Course Catalog In order to be assured that all prerequisites are met, students must acquire a permission number from the education coordinator prior to enrolling in any Biostatistics course. Courses are

### Natural Language Processing. Today. Logistic Regression Models. Lecture 13 10/6/2015. Jim Martin. Multinomial Logistic Regression

Natural Language Processing Lecture 13 10/6/2015 Jim Martin Today Multinomial Logistic Regression Aka log-linear models or maximum entropy (maxent) Components of the model Learning the parameters 10/1/15

### An introduction to Hidden Markov Models

An introduction to Hidden Markov Models Christian Kohlschein Abstract Hidden Markov Models (HMM) are commonly defined as stochastic finite state machines. Formally a HMM can be described as a 5-tuple Ω

### Molecular Biology Basic Concepts

Molecular Biology Basic Concepts Prof. Dr. Antônio Augusto Fröhlich Charles Ivan Wust LISHA - UFSC {guto charles}@lisha.ufsc.br http://www.lisha.ufsc.br/~{guto charles} September 2003 September 2003 http://www.lisha.ufsc.br/~guto

### Biology Performance Level Descriptors

Limited A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Biology. A student at this level has an emerging ability to describe genetic patterns of

### Base Sequence in DNA?

BIOPHYSICAL JOURNAL 71:1539-1544, 1996 Is There an Error Correcting Code in the Base Sequence in DNA? by Larry S. Liebovitch, Yi Tao, Angelo T. Todorov, and Leo Levine Center for Complex Systems Florida

### Life. In nature, we find living things and non living things. Living things can move, reproduce, as opposed to non living things.

Computat onal Biology Lecture 1 Life In nature, we find living things and non living things. Living things can move, reproduce, as opposed to non living things. Both are composed of the same atoms and

### Exercise 11 - Understanding the Output for a blastn Search (excerpted from a document created by Wilson Leung, Washington University)

Exercise 11 - Understanding the Output for a blastn Search (excerpted from a document created by Wilson Leung, Washington University) Read the following tutorial to better understand the BLAST report for

### Genetics Notes C. Molecular Genetics

Genetics Notes C Molecular Genetics Vocabulary central dogma of molecular biology Chargaff's rules messenger RNA (mrna) ribosomal RNA (rrna) transfer RNA (trna) Your DNA, or deoxyribonucleic acid, contains

### Concluding lesson. Student manual. What kind of protein are you? (Basic)

Concluding lesson Student manual What kind of protein are you? (Basic) Part 1 The hereditary material of an organism is stored in a coded way on the DNA. This code consists of four different nucleotides:

### Hidden Markov Models with Applications to DNA Sequence Analysis. Christopher Nemeth, STOR-i

Hidden Markov Models with Applications to DNA Sequence Analysis Christopher Nemeth, STOR-i May 4, 2011 Contents 1 Introduction 1 2 Hidden Markov Models 2 2.1 Introduction.......................................

CS 252 - Markov Chains Additional Reading 1 and Homework problems 1 Markov Chains The first model we discussed, the DFA, is deterministic it s transition function must be total and it allows for transition

### Opening Activity: Where in the cell does transcription take place? Latin Root Word: Review of Old Information: Transcription Video New Information:

Section 1.4 Name: Opening Activity: Where in the cell does transcription take place? Latin Root Word: Review of Old Information: Transcription Video New Information: Protein Synthesis: pages 193-196 As

### Translation Study Guide

Translation Study Guide This study guide is a written version of the material you have seen presented in the replication unit. In translation, the cell uses the genetic information contained in mrna to

### A Multiple DNA Sequence Translation Tool Incorporating Web Robot and Intelligent Recommendation Techniques

Proceedings of the 2007 WSEAS International Conference on Computer Engineering and Applications, Gold Coast, Australia, January 17-19, 2007 402 A Multiple DNA Sequence Translation Tool Incorporating Web

### RNA & Protein Synthesis

RNA & Protein Synthesis Genes send messages to cellular machinery RNA Plays a major role in process Process has three phases (Genetic) Transcription (Genetic) Translation Protein Synthesis RNA Synthesis

### Basic Concepts of DNA, Proteins, Genes and Genomes

Basic Concepts of DNA, Proteins, Genes and Genomes Kun-Mao Chao 1,2,3 1 Graduate Institute of Biomedical Electronics and Bioinformatics 2 Department of Computer Science and Information Engineering 3 Graduate

### NSilico Life Science Introductory Bioinformatics Course

NSilico Life Science Introductory Bioinformatics Course INTRODUCTORY BIOINFORMATICS COURSE A public course delivered over three days on the fundamentals of bioinformatics and illustrated with lectures,

### RNA Structure and folding

RNA Structure and folding Overview: The main functional biomolecules in cells are polymers DNA, RNA and proteins For RNA and Proteins, the specific sequence of the polymer dictates its final structure

### Alternative Splicing in Higher Plants. Just Adding to Proteomic Diversity or an Additional Layer of Regulation?

in Higher Plants Just Adding to Proteomic Diversity or an Additional Layer of Regulation? Alternative splicing is nearly ubiquitous in eukaryotes It has been found in plants, flies, worms, mammals, etc.

### THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS

THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS O.U. Sezerman 1, R. Islamaj 2, E. Alpaydin 2 1 Laborotory of Computational Biology, Sabancı University, Istanbul, Turkey. 2 Computer Engineering

### Lecture 11: Graphical Models for Inference

Lecture 11: Graphical Models for Inference So far we have seen two graphical models that are used for inference - the Bayesian network and the Join tree. These two both represent the same joint probability

### Mass Spectra Alignments and their Significance

Mass Spectra Alignments and their Significance Sebastian Böcker 1, Hans-Michael altenbach 2 1 Technische Fakultät, Universität Bielefeld 2 NRW Int l Graduate School in Bioinformatics and Genome Research,

### BIO 3350: ELEMENTS OF BIOINFORMATICS PARTIALLY ONLINE SYLLABUS

BIO 3350: ELEMENTS OF BIOINFORMATICS PARTIALLY ONLINE SYLLABUS NEW YORK CITY COLLEGE OF TECHNOLOGY The City University Of New York School of Arts and Sciences Biological Sciences Department Course title:

### Just the Facts: A Basic Introduction to the Science Underlying NCBI Resources

1 of 8 11/7/2004 11:00 AM National Center for Biotechnology Information About NCBI NCBI at a Glance A Science Primer Human Genome Resources Model Organisms Guide Outreach and Education Databases and Tools

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Cells and Their Housekeeping Functions Nucleus and Other Organelles

Cells and Their Housekeeping Functions Nucleus and Other Organelles Shu-Ping Lin, Ph.D. Institute of Biomedical Engineering E-mail: splin@dragon.nchu.edu.tw Website: http://web.nchu.edu.tw/pweb/users/splin/

### What is a Gene? HC70AL Spring An Introduction to Bioinformatics -- Part I. What are the 4 Nucleotides By in DNA?

APPENDIX 2 - BIOINFORMATICS (PARTS I AND II) What is a Gene? HC70AL Spring 2004 An ordered sequence of nucleotides An Introduction to Bioinformatics -- Part I What are the 4 Nucleotides By in DNA? Brandon

### DNA Replication & Protein Synthesis. This isn t a baaaaaaaddd chapter!!!

DNA Replication & Protein Synthesis This isn t a baaaaaaaddd chapter!!! The Discovery of DNA s Structure Watson and Crick s discovery of DNA s structure was based on almost fifty years of research by other

### Complexity in life, multicellular organisms and micrornas

Complexity in life, multicellular organisms and micrornas Ohad Manor Abstract In this work I would like to discuss the question of defining complexity, and to focus specifically on the question of defining

### A polynucleotide consisting of the nucleotide sequence of SEQ ID NO:2.

Case A A polynucleotide consisting of the nucleotide sequence of SEQ ID NO:1 nucleotide sequence of SEQ ID NO:1 is one of the sequences which were analyzed using an automated DNA sequencer The sequences

### Genome and DNA Sequence Databases. BME 110/BIOL 181 CompBio Tools Todd Lowe March 31, 2009

Genome and DNA Sequence Databases BME 110/BIOL 181 CompBio Tools Todd Lowe March 31, 2009 Admin Reading: Chapters 1 & 2 Notes available in PDF format on-line (see class calendar page): http://www.soe.ucsc.edu/classes/bme110/spring09/bme110-calendar.html

### Final Project Report

CPSC545 by Introduction to Data Mining Prof. Martin Schultz & Prof. Mark Gerstein Student Name: Yu Kor Hugo Lam Student ID : 904907866 Due Date : May 7, 2007 Introduction Final Project Report Pseudogenes

### Chapter 10: Protein Synthesis. Biology

Chapter 10: Protein Synthesis Biology Let s Review What are proteins? Chains of amino acids Some are enzymes Some are structural components of cells and tissues More Review What are ribosomes? Cell structures

### From DNA to RNA RNA is different from DNA in three (at least significant ways). 1. Ribose verses deoxyribose

Chapter 7 From DNA to a Protein: Two overriding processes: 1. Transcription (to write again) DNA- to RNA (note: no change in language, all nucleic acids.) Fig. 7.1 2. Translation: RNA- protein (change

### Lecture 6: The Bayesian Approach

Lecture 6: The Bayesian Approach What Did We Do Up to Now? We are given a model Log-linear model, Markov network, Bayesian network, etc. This model induces a distribution P(X) Learning: estimate a set

### Regulation of Gene Expression

Chapter 18 Regulation of Gene Expression PowerPoint Lecture Presentations for Biology Eighth Edition Neil Campbell and Jane Reece Lectures by Chris Romero, updated by Erin Barley with contributions from

### MODULE 2: TRANSCRIPTION PART I

MODULE 2: TRANSCRIPTION PART I Lesson Plan: Title MARIA S. SANTISTEBAN Transcription Part I: From DNA sequence to transcription unit Objectives Describe how a primary transcript (pre-mrna) can be synthesized

### Master's projects at ITMO University. Daniil Chivilikhin PhD Student @ ITMO University

Master's projects at ITMO University Daniil Chivilikhin PhD Student @ ITMO University General information Guidance from our lab's researchers Publishable results 2 Research areas Research at ITMO Evolutionary

### 2. The number of different kinds of nucleotides present in any DNA molecule is A) four B) six C) two D) three

Chem 121 Chapter 22. Nucleic Acids 1. Any given nucleotide in a nucleic acid contains A) two bases and a sugar. B) one sugar, two bases and one phosphate. C) two sugars and one phosphate. D) one sugar,

### Discrete Optimization Introduction & applications

Discrete Optimization 2013 1/21 Discrete Optimization Introduction & applications Bertrand Cornélusse ULg - Institut Montefiore 2013 Discrete Optimization 2013 2/21 Outline Introduction Some applications

### Transcription recap What is translation? Short Video Activity. Initiation Elongation Termination. Short Quiz on Thursday! 6.1 and 6.

Protein Synthesis Transcription recap What is translation? Initiation Elongation Termination Short Video Activity Short Quiz on Thursday! 6.1 and 6.2 1. RNA polymerase attaches to promoter region 2. Unwinds/unzips

### Homologous Gene Finding with a Hidden Markov Model

Homologous Gene Finding with a Hidden Markov Model by Xuefeng Cui A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathematics in Computer

### Conditional Random Fields: An Introduction

Conditional Random Fields: An Introduction Hanna M. Wallach February 24, 2004 1 Labeling Sequential Data The task of assigning label sequences to a set of observation sequences arises in many fields, including

### Hidden Markov models in biological sequence analysis

Hidden Markov models in biological sequence analysis by E. Birney The vast increase of data in biology has meant that many aspects of computational science have been drawn into the field. Two areas of

### DNA, genes and chromosomes

DNA, genes and chromosomes Learning objectives By the end of this learning material you would have learnt about the components of a DNA and the process of DNA replication, gene types and sequencing and

### NLP Programming Tutorial 5 - Part of Speech Tagging with Hidden Markov Models

NLP Programming Tutorial 5 - Part of Speech Tagging with Hidden Markov Models Graham Neubig Nara Institute of Science and Technology (NAIST) 1 Part of Speech (POS) Tagging Given a sentence X, predict its

### Genetic programming with regular expressions

Genetic programming with regular expressions Børge Svingen Chief Technology Officer, Open AdExchange bsvingen@openadex.com 2009-03-23 Pattern discovery Pattern discovery: Recognizing patterns that characterize

### The Basics of Graphical Models

The Basics of Graphical Models David M. Blei Columbia University October 3, 2015 Introduction These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. Many figures

### Using the NCBI Genome Databases to Compare the Genes for Human & Chimpanzee Beta Hemoglobin

Using the NCBI Genome Databases to Compare the Genes for Human & Chimpanzee Beta Hemoglobin Author(s) :Susan Offner Source: The American Biology Teacher, 72(4):252-256. 2010. Published By: National Association