1 / 35

Gene Prediction in Genomic Studies Ab-initio based methods

Gene Prediction in Genomic Studies Ab-initio based methods. Angela Pena Gonzalez Lavanya Rishishwar. What Gene Prediction means and a brief background. Introduction. Introduction: Gene Prediction.

javier
Download Presentation

Gene Prediction in Genomic Studies Ab-initio based methods

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Gene Prediction in Genomic StudiesAb-initio based methods Angela Pena Gonzalez Lavanya Rishishwar

  2. What Gene Prediction means and a brief background Introduction

  3. Introduction: Gene Prediction • Gene Prediction is the process of detection of the location of open reading frames (ORFs) and delineation of the structures of introns as well as exons if the genes of interest are of eukaryotic origin. • The ultimate goal is to describe all the genes computationally with near 100% accuracy

  4. Introduction: ORF • Reading Frame: A sequence of DNA/RNA that is translated into an amino acid sequence, three bases at a time, each triplet sequence coding for a single amino acid • Every region of DNA has six possible reading frames • Open Reading Frame (ORF) is the longest frame uninterrupted by a stop codon

  5. Introduction: ORF • Not all translations have a biochemical support for them, some are merely derived theoretically or computationally • In other words, each gene is an ORF but not ever ORF is a gene

  6. Introduction: Gene • Genes are the functional and physical unit of heredity passed from parent to offspring. • Genes are pieces of DNA, and most genes contain the information for making a specific protein.

  7. Introduction: Gene Models Prokaryotic Eukaryotic

  8. Introduction: Coding v/s Noncoding Coding region Noncoding region Noncoding regions are the parts of DNA which do not encode protein sequences. They may or may not be transcribed into RNA. E.g.: tRNA, rRNA, sRNA genes Coding regions are the parts of DNA which will give rise to a mature messenger RNA that will be translated into the specific amino acids of the protein product

  9. Why we need gene prediction algorithms? Necessity

  10. Necessity • There have been a sharp up trend in the number of genomes sequenced in the past decade.

  11. Necessity No. of Genomes in KEGG KEGG Genome: Release Update of Jan 2012

  12. Necessity • There have been a sharp up trend in the number of genomes sequenced in the past decade. • Accurately predicting genes can significantly reduce the amount of experimental verification work which is time and labor consuming and expensive to carry out • Current state-of-art gene predictors have a high accuracy of ~90-99% (i.e., able to predict >90% of the experimentally validated genes)

  13. How the gene predictors make the predictions? Methods

  14. Gene Prediction Methods • Gene Prediction represents one of the most difficult problems in the field of pattern recognition, particularly in the case of eukaryotes • The principle difficulties are: • Detection of initiation site (AUG) • Alternative start codons • Gene overlap • Undetected small proteins

  15. Gene Prediction Methods ACGTACTACGTACGTACGTACGATCGATCGATCGATCGATCGACTGATCGATCGATCGATCGTACGTAGCGACTGACTGACTGATCGACTACGTAGCTGCAGTCAGTCGACTGACTGACTA Ab-initio methods Ab-initio methods Homology based methods

  16. Ab-initio Methods • Predicts gene based on the given sequence alone. • Consists of two types of models: • Markov based models • Dynamic Programming

  17. A brief introduction of HMMs • Hidden Markov models (HMMs) are discrete Markov processes where every state generates an observation at each time step. • A hidden Markov model (HMM) is statistical Markov model in which the system being modeled is assumed to be a Markov process with unobserved (hidden) states.

  18. Markov Model (Discrete Markov Process) • A discrete Markov process is a sequence of random variables q1,…,qt that take values in a discrete set S={s1,…,sN} where the Markov property holds. • Markov property: • Parameters • Initial state probabilities: πi • State transition probabilities: aij

  19. From Markov Model to HMM • HMMs are discrete Markov processes where each state also emits an observation according to some probability distribution, we need to augment our model. • Parameters • Initial state probabilities: πi • State transition probabilities: aij • Emission probabilities: ei(k)

  20. ¡Empecemos!

  21. Say Adios to your windows and get to Linux!! Say “Si” when you are ready to work on Linux!!! Di que “Si” situestaslistoparatrabajar con Linux!!!

  22. A Quick Linux How-To Manual • Terminal (and Kernel)!“That’s Linux to me!” – Lava • Basic Navigations in Terminal: • Change to a specific directory – cd • List the contents of the folder – ls • Come up one level of the folder – cd .. • Copy a file to one location to another – cp • Move a file from one location to another – mv • Rename a file (file1) to (file2) – mv file1 file2

  23. A Quick Linux How-To Manual • Autocomplete – tab! • Extract a file – tar –xvf [file name] • Installing a software: • Navigate to the folder where “Makefile” is present • Type make • Wait for the installer to finish processing • Programs will be stored in the same folder or a different folder by the name “bin” (stands for basic input)

  24. That’s all Folks, Thank you for coming, Gracious!

  25. Naah, Just kidding! Lets get down to business!

  26. GeneMark • Developed by Dr. Mark Borodovsky (from Georgia Tech!) • Works on elegant pseudo-HMMs and HMM • Several versions available – prokayotic/eukaryotic, self training

  27. Running GeneMark • ./gmsn.pl --prok --out [output file] [genome file]

  28. Glimmer3 • Works by creating a variable-length Markov model from a training set of genes • Using the model to identify all genes in a DNA sequence

  29. Running Glimmer3 • It’s a 2 step progress • A probability model of coding sequences must be built called an interpolated context model../build-icm[model name] < [genome] • Program is run to analyze the sequences and make gene predictions./glimmer3 [genome] [icm_model] [output] • Best results require longest possible training set of genes

  30. Glimmer3 programs (if you are curious) • Long-orfs uses an amino-acid distribution model to filter the set of orfs • Extract builds training set from long, nonoverlappingorfs • Build-icm build interpolated context model from training sequences • Glimmer3 analyze sequences and make predictions

  31. RNA Prediction

  32. Running tRNA-Scan-SE tRNAscan-SE –B -o <outputfile1> -f <outputfile2> -m <outputfile3> <inputfile> -B <file> : search for bacterial tRNAs This option selects the bacterial covariace model for tRNA analysis, and loosens the search parameters for EufindtRNA to improve detection o f bacterial tRNAs. -o <file> : save final results in <file> Specifiy this option to write results to <file>. -f <file> : save results and tRNA secondary structures to <file>. -m <file> : save statistics summary for run contains the run options selected as well as statistics on the number of tRNAs detected at each phase of the search, search speed, and other statistics.

  33. Output using “–o” parameter Output using “–f” parameter

  34. Yes I am serious. We are done. You are saved! Thank you

More Related