CSE182-L10 MS Spec Applications + Gene Finding + Projects.

Slides:



Advertisements
Similar presentations
Gene Prediction: Similarity-Based Approaches
Advertisements

HIDDEN MARKOV MODELS IN COMPUTATIONAL BIOLOGY CS 594: An Introduction to Computational Molecular Biology BY Shalini Venkataraman Vidhya Gunaseelan.
Two short pieces MicroRNA Alternative splicing.
Ab initio gene prediction Genome 559, Winter 2011.
 CpG is a pair of nucleotides C and G, appearing successively, in this order, along one DNA strand.  CpG islands are particular short subsequences in.
Hidden Markov Models CBB 231 / COMPSCI 261. An HMM is a following: An HMM is a stochastic machine M=(Q, , P t, P e ) consisting of the following: a finite.
Profiles for Sequences
درس بیوانفورماتیک December 2013 مدل ‌ مخفی مارکوف و تعمیم ‌ های آن به نام خدا.
1 Computational Molecular Biology MPI for Molecular Genetics DNA sequence analysis Gene prediction Gene prediction methods Gene indices Mapping cDNA on.
RNA-Seq An alternative to microarray. Steps Grow cells or isolate tissue (brain, liver, muscle) Isolate total RNA Isolate mRNA from total RNA (poly.
Gene Prediction Methods G P S Raghava. Prokaryotic gene structure ORF (open reading frame) Start codon Stop codon TATA box ATGACAGATTACAGATTACAGATTACAGGATAG.
Lecture 6, Thursday April 17, 2003
Gene prediction and HMM Computational Genomics 2005/6 Lecture 9b Slides taken from (and rapidly mixed) Larry Hunter, Tom Madej, William Stafford Noble,
Hidden Markov Models Sasha Tkachev and Ed Anderson Presenter: Sasha Tkachev.
Additional Powerful Molecular Techniques Synthesis of cDNA (complimentary DNA) Polymerase Chain Reaction (PCR) Microarray analysis Link to Gene Therapy.
1 Gene Finding Charles Yan. 2 Gene Finding Genomes of many organisms have been sequenced. We need to translate the raw sequences into knowledge. Where.
Gene Finding (DNA signals) Genome Sequencing and assembly
Introduction to BioInformatics GCB/CIS535
Gene Finding Charles Yan.
CSE182-L10 Gene Finding.
CSE182-L12 Gene Finding.
Comparative ab initio prediction of gene structures using pair HMMs
CSE182-L7 Protein Sequence Analysis using HMMs, Gene Finding.
RNA-Seq An alternative to microarray. Steps Grow cells or isolate tissue (brain, liver, muscle) Isolate total RNA Isolate mRNA from total RNA (poly.
Eukaryotic Gene Finding
Fa 05CSE182 CSE182-L8 Mass Spectrometry. Fa 05CSE182 Bio. quiz What is a gene? What is a transcript? What is translation? What are microarrays? What is.
CSE182-L8 Gene Finding. Project EST clustering and assembly Given a collection of EST (3’/5’) sequences, your goal is to cluster all ESTs from the same.
Lecture 12 Splicing and gene prediction in eukaryotes
Eukaryotic Gene Finding
A combination of the words Proteomics and Genomics. Proteogenomics commonly refer to studies that use proteomic information, often derived from mass spectrometry,
Biological Motivation Gene Finding in Eukaryotic Genomes
Gene Structure and Identification
Gene finding with GeneMark.HMM (Lukashin & Borodovsky, 1997 ) CS 466 Saurabh Sinha.
BME 110L / BIOL 181L Computational Biology Tools October 29: Quickly that demo: how to align a protein family (10/27)
Motif finding with Gibbs sampling CS 466 Saurabh Sinha.
Expression of the Genome The transcriptome. Decoding the Genetic Information  Information encoded in nucleotide sequences contained in discrete units.
DNA sequencing. Dideoxy analogs of normal nucleotide triphosphates (ddNTP) cause premature termination of a growing chain of nucleotides. ACAGTCGATTG ACAddG.
Gene finding and gene structure prediction M. Fatih BÜYÜKAKÇALI Computational Bioinformatics 2012.
A markovian approach for the analysis of the gene structure C. MelodeLima 1, L. Guéguen 1, C. Gautier 1 and D. Piau 2 1 Biométrie et Biologie Evolutive.
Fea- ture Num- ber Feature NameFeature description 1 Average number of exons Average number of exons in the transcripts of a gene where indel is located.
Computational Genomics and Proteomics Lecture 8 Motif Discovery C E N T R F O R I N T E G R A T I V E B I O I N F O R M A T I C S V U E.
10-07CSE182 CSE182-L7 Protein Sequence Analysis Patterns (regular expressions) Profiles HMM Gene Finding.
Eukaryotic Genomes  The Organization and Control of Eukaryotic Genomes.
Control of Gene Expression Chapter Proteins interacting w/ DNA turn Prokaryotic genes on or off in response to environmental changes  Gene Regulation:
Questions?. Novel ncRNAs are abundant: Ex: miRNAs miRNAs were the second major story in 2001 (after the genome). Subsequently, many other non-coding genes.
Gene Prediction: Similarity-Based Methods (Lecture for CS498-CXZ Algorithms in Bioinformatics) Sept. 15, 2005 ChengXiang Zhai Department of Computer Science.
Mark D. Adams Dept. of Genetics 9/10/04
Comp. Genomics Recitation 9 11/3/06 Gene finding using HMMs & Conservation.
From Genomes to Genes Rui Alves.
CSE182-L9 Gene Finding (DNA signals) Genome Sequencing and assembly.
Eukaryotic Gene Structure. 2 Terminology Genome – entire genetic material of an individual Transcriptome – set of transcribed sequences Proteome – set.
CSE182 CSE182-L11 Protein sequencing and Mass Spectrometry.
Alternative Splicing (a review by Liliana Florea, 2005) CS 498 SS Saurabh Sinha 11/30/06.
Genes and Genomes. Genome On Line Database (GOLD) 243 Published complete genomes 536 Prokaryotic ongoing genomes 434 Eukaryotic ongoing genomes December.
JIGSAW: a better way to combine predictions J.E. Allen, W.H. Majoros, M. Pertea, and S.L. Salzberg. JIGSAW, GeneZilla, and GlimmerHMM: puzzling out the.
Bioinformatics Workshops 1 & 2 1. use of public database/search sites - range of data and access methods - interpretation of search results - understanding.
Applications of HMMs in Computational Biology BMI/CS 576 Colin Dewey Fall 2010.
(H)MMs in gene prediction and similarity searches.
BIOINFORMATICS Ayesha M. Khan Spring 2013 Lec-8.
A knowledge-based approach to integrated genome annotation Michael Brent Washington University.
Fa07CSE182-L8 HMMs, Gene Finding. Fa07CSE182-L8 Midterm 1 In class next Tuesday Syllabus: L1-L8 –Please review HW, questions, and other notes –Bring one.
1 Gene Finding. 2 “The Central Dogma” TranscriptionTranslation RNA Protein.
bacteria and eukaryotes
Eukaryotic Gene Structure
What is a Hidden Markov Model?
CSE182-L12 Gene Finding.
Eukaryotic Gene Finding
Ab initio gene prediction
Introduction to Bioinformatics II
DNA and the Genome Key Area 3b Transcription.
Presentation transcript:

CSE182-L10 MS Spec Applications + Gene Finding + Projects

Relative abundance computation Once we have features matched across runs, we have data identical to microarrays. Features can be ‘identified’ in separate MS2 experiments run feature intensity

Structural genomics via MS

Cross-linking Cross-links are ‘fixed’ length that bind to amino-acids. How can they help predict structure? Protocol –Cross-link native protein –Denature, digest –MS/MS (identify cross-linked peptides) Potentially valuable, but not widely used

Identifying Cross-linked peptides Identify all peptide pairs, whose mass explains the parent mass. Given a list of peptide pairs, find the pair, and the linked position that best explains the MS2 data. What is the number of possible candidate pairs. Fragmentation in the presence of linkers is poorly understood How do you separate cross-linked peptides from singly linked, and non-cross-linked peptides?

Identifying cross-linked peptides Use isotopically labeled cross-linking agents. Cross-linked peptides will show up as pairs separated by a small mass. Non cross-linked peptides appear at one position only.

MS application: Protein-protein interaction Proteins combine to form functional complexes. An antibody is a special kind of protein that can recognize a specific protein Use an antibody to recognize a protein in a complex. Isolate & Purify the complex that binds to the antibody. Identify all the proteins in the complex via mass spectrometry.

Mass Spectrometry: conclusion Mass Spectrometry can be used to identify peptides, modifications, quantitation, protein structure, protein-protein interaction (complex formation) Each of these poses significant computational challenges.

Proteomic Databases/Tools

Eukaryotic Gene Prediction

Eukaryotic gene structure

Translation

Gene Features ATG 5’ UTR intron exon 3’ UTR Acceptor Donor splice site Transcription start Translation start

Gene identification Eukaryotic gene definitions: –Location that codes for a protein –The transcript sequence(s) that encodes the protein –The protein sequence(s) Suppose you want to know all of the genes in an organism. This was a major problem in the 70s. PhDs, and careers were spent isolating a single gene sequence. All of that changed with the development of high throughput methods like EST sequencing

EST Sequencing Suppose we could collect all of the mRNA. However, mRNA is unstable An enzyme called reverse transcriptase is used to make a DNA copy of the RNA. Use DNA polymerase to get a complementary DNA strand. Sequence the (stable) cDNA from both ends. This leads to a collection of transcripts/expressed sequences (ESTs). Many might be from the same gene AAAA TTTT AAAA TTTT

EST Sequencing Often, reverse transcriptase breaks off early. Why is this a good thing? The 3’ end may not have a much coding sequence. We can assemble the 5’ end to get more of the coding sequence

Project 2 EST assembly Given a collection of EST (3’) sequences, your goal is to cluster all ESTs from the same gene, and produce a consensus. How would you do it if we also had 5’ EST sequences?

Project 1 Goal: Look for signals in the UTR. The UTR is not boring. It often folds into a 2 D structure and subsequently affects transcription/translation of genes. What are Riboswitches? miRNA?

Project 3 Goal is to predict expressed genes using ESTs/proteins and mass spectrometry.

Project guidelines 4 Checkpoints. The first is mainly to identify a project, project partners, and answer a few simple questions to get started. Deadline 11/3/05.

Gene Finding: The 1st generation Given genomic DNA, does it contain a gene (or not)? Key idea: The distributions of nucleotides is different in coding (translated exons) and non- coding regions. Therefore, a statistical test can be used to discriminate between coding and non-coding regions.

Coding versus Non-coding You are given a collection of exons, and a collection of intergenic sequence. Count the number of occurrences of ATGATG in Introns and Exons. –Suppose 1% of the hexamers in Exons are ATGATG –Only 0.01% of the hexamers in Intons are ATGATG How can you use this idea to find genes?

Generalizing AAAAAA AAAAAC AAAAAG AAAAAT IE Compute a frequency count for all hexamers. Use this to decide whether a sequence is an exon/intron

Coding versus non-coding Fickett and Tung (1992) compared various measures Measures that preserve the triplet frame are the most successful. Genscan: 5th order Markov Model Conservation across species

Coding vs. non-coding regions Compute average coding score (per base) of exons and introns, and take the difference. If the measure is good, the difference must be biased away from 0.

Coding differential for 380 genes

Other Signals GT ATG AG Coding

Coding region can be detected Coding Plot the coding score using a sliding window of fixed length. The (large) exons will show up reliably. Not enough to predict gene boundaries reliably

Other Signals GT ATG AG Coding Signals at exon boundaries are precise but not specific. Coding signals are specific but not precise. When combined they can be effective

The second generation of Gene finding Ex: Grail II. Used statistical techniques to combine various signals into a coherent gene structure. It was not easy to train on many parameters. Guigo & Bursett test revealed that accuracy was still very low. Problem with multiple genes in a genomic region

HMMs and gene finding HMMs allow for a systematic approach to merging many signals. They can model multiple genes, partial genes in a genomic region, as also genes on both strands.

The Viterbi Algorithm

HMMs and gene finding The Viterbi algorithm (and backtracking) allows us to parse a string through the states of an HMM Can we describe Eukaryotic gene structure by the states of an HMM? This could be a solution to the GF problem.

An HMM for Gene structure

Generalized HMMs, and other refinements A probabilistic model for each of the states (ex: Exon, Splice site) needs to be described In standard HMMs, there is an exponential distribution on the duration of time spent in a state. This is violated by many states of the gene structure HMM. Solution is to model these using generalized HMMs.

Length distributions of Introns & Exons

Generalized HMM for gene finding Each state also emits a ‘duration’ for which it will cycle in the same state. The time is generated according to a random process that depends on the state.

Forward algorithm for gene finding ji qkqk Emission Prob.: Probability that you emitted X i..X j in state q k (given by the 5th order markov model) Forward Prob: Probability that you emitted I symbols and ended up in state q k Duration Prob.: Probability that you stayed in state q k for j-i+1 steps

HMMs and Gene finding Generalized HMMs are an attractive model for computational gene finding –Allow incorporation of various signals –Quality of gene finding depends upon quality of signals.

DNA Signals Coding versus non-coding Splice Signals Translation start

Splice signals GT is a Donor signal, and AG is the acceptor signal GTAG

PWMs Fixed length for the splice signal. Each position is generated independently according to a distribution Figure shows data from > 1200 donor sites AAGGTGAGTCCGGTAAGTGAGGTGAGGTAGGTAAGG

MDD PWMs do not capture correlations between positions Many position pairs in the Donor signal are correlated

Choose the position which has the highest correlation score. Split sequences into two: those which have the consensus at position I, and the remaining. Recurse until

MDD for Donor sites

De novo Gene prediction: Sumary Various signals distinguish coding regions from non-coding HMMs are a reasonable model for Gene structures, and provide a uniform method for combining various signals. Further improvement may come from improved signal detection

How many genes do we have? Nature Science

Alternative splicing

Comparative methods Gene prediction is harder with alternative splicing. One approach might be to use comparative methods to detect genes Given a similar mRNA/protein (from another species, perhaps?), can you find the best parse of a genomic sequence that matches that target sequence Yes, with a variant on alignment algorithms that penalize separately for introns, versus other gaps.

Comparative gene finding tools Procrustes/Sim4: mRNA vs. genomic Genewise: proteins versus genomic CEM: genomic versus genomic Twinscan: Combines comparative and de novo approach.