Professional Documents
Culture Documents
BADSHA ALI
application:
Model protein and gene interactions
Dynamical analysis of such models
Understand system properties
Predict system level behaviors
Define gene:
A gene is the basic physical and functional unit of heredity. Genes are made up of DNA. Some
genes act as instructions to make molecules called proteins.
Categories of RNA:
RNA can be divided into two categories
Coding RNAs:Coding RNAs as is obvious from their name, code for Proteins
Non-Coding RNAs: Non-Coding RNAs regulate/assist in the process of translation
FASTA algorithm:
FASTA can search sequence databases and identify unknown sequences by comparing them to
the known sequence databases. • This can help obtain information on the parent organism,
function and evolutionary history.
DOMAIN SHUFFLING:
Aligned portions of sequence can be considered in varying orders and this process is called as
domain shuffling.
ADVENTAGES
We can compare the different length sequences
Conserved domains can be determined from proteins
Common function features can be identified.
Scoring matrices:
Scoring matrices are used to determine the relative score made by matching two characters in a
sequence alignment. These are usually log-odds of the likelihood of two characters being derived
from a common ancestral character. There are many flavors of scoring matrices for amino acid
sequences, nucleotide sequences, and codon sequences, and each is derived from the alignment
of "known" homologous sequences. These alignments are then used to determine the likelihood
of one character being at the same position in the sequence as another character.
Progressive alignment?
Progressive alignment (Feng and Doolittle, 1987) is a heuristic for multiple sequence alignment
that does not optimize any obvious alignment score. The idea is to do a succession of pairwise
alignments, starting with the most similar pairs of sequences and proceeding to less similar ones.
dynamic programming:
Dynamic programming is both a mathematical optimization method and a computer
programming method. Likewise, in computer science, if a problem can be solved optimally by
breaking it into sub-problems and then recursively finding the optimal solutions to the sub-
problems, then it is said to have optimal substructure.
2’ RNA structures:
2’ RNA structures form as a result of bonding between complementary nucleotides within an
RNA molecule • However, some nucleotides are still left open for interaction. There are
structural patterns in RNA 2’ structure. These include: Helices, Loops, Bulges & Junctions.
Central dogma:
DNA has four nucleotides bases (A, C, T & G). RNA contains (A, C, U & G). And protein
contain 20 different amino acids. DNA to RNA then Protein is called as central dogma. Which
includes translation, transcription and protein modifications.
Components of MS:
Sample Injection
Ionization Source
Mass Analyzer
Ion Detector
Spectra search using computational tools
How Dynammic programming (DP) creat scoring functions which deal with
the matches mismatches and gaps. Also calculate: