Course Overview
|
Course Synopsis
|
The course will provide basic knowledge to the beginners in bioinformatics. Mainly this course is designed to acquaint the students with bioinformatics, its methods and goals. The students would learn how bioinformatics differs from traditional biology and how traditional research methods can be improved using bioinformatics. What are modern day Genome Sequencing and analysis techniques and their applications? They will also be introduced with major Algorithms used for solving Biological problems.
|
Course Learning Outcomes
|
At the end of the course, you should be able to:
- Recognize the importance of Bioinformatics in modern day research
- What are main kinds of Biological data and how this data is stored into and retrieve from Biological databases?
- Clear understanding of different types of Biological problems and major computational approaches to address these issue.
- Have insights into Genomes and complexities of their analysis.
- Relate the role of overlapping areas like Statistics and Mathematics in Bio-Computing
- Explore modern day Genome sequencing technologies and the analysis of the high throughput data they generate.
- Clear understanding of new requirements of Biologists (end users) and the approaches to find the most probable answers.
|
Course Calendar
|
2
|
Introducing Bioinformatics
|
3
|
Scope of Bioinformatics
|
4
|
Challenges in Bioinformatics
|
5
|
Collaborating expertise
|
6
|
Deoxy Ribose Nucleic Acid (DNA)
|
7
|
Ribose Nucleic Acid (RNA)
|
10
|
Exceptions to central dogma of life
|
11
|
Introduction to Bioinformatics Algrorithms
|
12
|
Tasks in Bioinformatics
|
13
|
Introducing Algorithms I
|
14
|
Introducing Algorithms II
|
15
|
Biological vs Computer Algorithms
|
17
|
Approaches to design Algorithms
|
18
|
Nucleotide Sequence databases
|
20
|
Genome and organism specific databases
|
21
|
Gene expression databases
|
24
|
DNA Sequence Retrieval
|
25
|
Protein Sequence Retrieval
|
31
|
Epichromosomal elements (EEs)
|
33
|
Transposable Elements (TEs)
|
34
|
Eukaryotic Gene Structure
|
36
|
Comparative Proteomics
|
37
|
Between proteome comparison
|
38
|
Horizontal Gene Transfer
|
42
|
Developments for sequencing 1
|
43
|
Developments for sequencing 2
|
51
|
Characteristics of Human genes
|
53
|
Next Generation sequencing (NGS)
|
60
|
Ion Semiconductor sequencing
|
61
|
3rd Generation Sequencing
|
64
|
Oxford Nanopore Sequencing
|
65
|
Comparison of NGS methods
|
69
|
Transcriptome Sequencing
|
72
|
Five Big Projects in NGS
|
75
|
NGS Data Quality Control
|
79
|
NGS: Mapping and Visualization
|
81
|
Genome Assembly Overview
|
82
|
Genome Assembly Planning
|
84
|
Related species Assembled
|
85
|
Greedy Graph Algorithm
|
90
|
Quality of Assembled Genome
|
92
|
Overlap Layout Consensus
|
94
|
De Bruijn Graph Example
|
96
|
Introduction to Statistics
|
99
|
Measure of Central Tendency
|
103
|
Mutually Exclusive Events
|
104
|
Union and Intersections
|
105
|
Types of Probabilities
|
107
|
Occasionally dishonest casino
|
108
|
Maximum Likelihood Estimation
|
109
|
Binomial Distribution
|
112
|
Probabilities in Markov Models
|
114
|
Markov Chains for Discrimination
|
115
|
Occasionally Dishonest Casino 2
|
122
|
Prediction of Splice Junctions
|
124
|
Annotation of assembeled Genome
|
125
|
Pattern Finding in a Genome
|
126
|
Pattern Finding Algorithms
|
128
|
Knuth-Morris-Pratt Algorithm
|
131
|
Boyer Moore Algorithm
|
132
|
Pair Sequence Alignment
|
135
|
Optimal Alignment Methods
|
136
|
Needleman-Wunsch Algorithm
|
137
|
Needleman-Wunsch Execution
|
138
|
Smith-Waterman Algorithm
|
145
|
Significance of Scores
|
146
|
Extreme value Distribution (EVD)
|
147
|
Hidden Markov Model (HMM)
|
148
|
HMM: Generating Sequences
|
149
|
HMM: Classical problem
|
150
|
HMM: Viterbi Algorithm
|
152
|
HMM Example Casino Revisited
|
153
|
Multiple Sequence Alignment
|
159
|
MSA: Progressive Method
|
160
|
MSA: Iterative Methods
|
163
|
Assessing Quality of MSA
|
166
|
Phylogenetic Analysis
|
167
|
Phylogenetic Analysis and MSA
|
169
|
Moleculer Phylogenetics
|
170
|
Tree Reconstruction Methods
|
171
|
Maximum Parsimony Method
|
172
|
Maximum Likelihood Method
|
175
|
Fitch Morgolish Algorithm
|
176
|
Neighbor Joining Method
|
178
|
RNA Secondary Structure
|
179
|
RNA Secondary Structure Prediction
|
180
|
Base Pair Maximization
|
182
|
Transformational Grammars
|
188
|
Microarray Image Processing
|
189
|
Microarray Normalization
|
190
|
Within Array Normalization
|
191
|
Between Array Normalization
|
200
|
GO functional Analysis
|
|
|
|