Team I Gene Prediction Group: Difference between revisions
Jump to navigation
Jump to search
Line 23: | Line 23: | ||
**Markov model is a stochastic model that can model the dynamics of systems. This system is made up of known states with a known transition probability which depends only on current states. In other words, the future state depends only on the current state, not the previous one. | **Markov model is a stochastic model that can model the dynamics of systems. This system is made up of known states with a known transition probability which depends only on current states. In other words, the future state depends only on the current state, not the previous one. | ||
**Hidden Markov Model(HMM) is described as a Markov model of random changing systems that is made up of unobserved(hidden) states. This model can determine state transition probability which is the probability between each hidden state and generate observable nucleotides. | **Hidden Markov Model(HMM) is described as a Markov model of random changing systems that is made up of unobserved(hidden) states. This model can determine state transition probability which is the probability between each hidden state and generate observable nucleotides. | ||
*'''GeneMarkS2''' | |||
**Self-training algorithm based on an HMM | |||
**Models transcription domain to predict gene start more accurately | |||
**incl. heuristic model designed to predict horizontally transferred genes | |||
**Pros and cons: GMS2 can have the highest sensitivity and specificity among different tools, but works on different gene regulatory motifs using learered and leaderless transcription. |
Revision as of 15:02, 4 March 2020
Members: Maria Ahmad, Hira Anis, Jessica Mulligan, Priya Narayanan, Aaron Pfennig, Winnie Zheng
Introduction
Prokaryotic Gene Feature
- Prokaryotic genes have a relatively well-understood promoter sequence, such as a regulatory sequence, which can regulate the transcription of the gene into an mRNA.
- Each prokaryotic gene has open reading frames(ORF) which start with start codons and end with end codons with no interruptions(end-codons) in-between, so it can provide a good, but not assured prediction of the protein-coding regions.
Gene Prediction
Gene prediction or gene finding is a process of identifying the regions of genomic DNA that encode genes. It is devised two-classes of methods that use similarity-based(homology) searches and ab initio prediction to capture the compositional differences among coding regions which will be translated into protein and noncoding DNA which can be translated into tRNAs and rRNAs.
Project Goal
The main goal of our project is to finish the gene prediction for the assembled gene from E.coli given by the previous group.
Methods
Ab-initio Methods(CDS prediction)
- Features of Predicting protein-coding genes
- ORFs
- Signal Sensor: Regulatory motifs(RBS, SD, etc)
- Content Sensor: The codon usage bias, based on GC content, can help to distinguish coding sequence from surrounding non-coding sequence.
- Markov and Hidden Markov Model
- Markov model is a stochastic model that can model the dynamics of systems. This system is made up of known states with a known transition probability which depends only on current states. In other words, the future state depends only on the current state, not the previous one.
- Hidden Markov Model(HMM) is described as a Markov model of random changing systems that is made up of unobserved(hidden) states. This model can determine state transition probability which is the probability between each hidden state and generate observable nucleotides.
- GeneMarkS2
- Self-training algorithm based on an HMM
- Models transcription domain to predict gene start more accurately
- incl. heuristic model designed to predict horizontally transferred genes
- Pros and cons: GMS2 can have the highest sensitivity and specificity among different tools, but works on different gene regulatory motifs using learered and leaderless transcription.