[wpseo_breadcrumb]
BIF501 036 Practical Restriction Mapping Algorithm (V-U)
- Course:Bioinformatics II (V-U)
- Discipline:Basic and Health Sciences
- Institute:Virtual University
- Instructor(s): Khizra Maqsood
- Level:Undergraduate
Bioinformatics II (V-U)
- BIF501 001 Applications of Bioinformatics-I (V-U)
- BIF501 002 Applications of Bioinformatics-II (V-U)
- BIF501 003 Nucleotide Sequence databases (V-U)
- BIF501 004 Protein databases (V-U)
- BIF501 005 Genome and organism specific databa… (V-U)
- BIF501 007 Medical databases (V-U)
- BIF501 006 Gene expression databases (V-U)
- BIF501 008 Sequence submission (V-U)
- BIF501 009 DNA Sequence Retrieval (V-U)
- BIF501 010 Protein Sequence Retrieval (V-U)
- BIF501 011 Sequence Formats (V-U)
- BIF501 012 Data Retrieval (V-U)
- BIF501 014 Prokaryotic Genome (V-U)
- BIF501 013 Genome Informatics (V-U)
- BIF501 015 Eukaryotic Genomes (V-U)
- BIF501 016 Epichromosomal elements (EEs) (V-U)
- BIF501 017 Genome repeats (V-U)
- BIF501 018 Transposable Elements (TEs) (V-U)
- BIF501 019 Eukaryotic Gene Structure (V-U)
- BIF501 020 Comparative Genomics (V-U)
- BIF501 021 Comparative Proteomics (V-U)
- BIF501 026 Genome Sequencing (V-U)
- BIF501 022 Between proteome comparison (V-U)
- BIF501 024 Gene Order (Synteny) (V-U)
- BIF501 027 Structure of RNA (V-U)
- BIF501 023 Horizontal Gene Transfer (V-U)
- BIF501 025 Genome annotations (V-U)
- BIF501 028 DNA Transcription (V-U)
- BIF501 029 Protein Translation (V-U)
- BIF501 031 Dynamic Programming II (V-U)
- BIF501 030 Dynamic Programming I (V-U)
- BIF501 032 Algorithm for Dynamic Programming (V-U)
- BIF501 033 Restriction Mapping I (V-U)
- BIF501 034 Restriction Mapping II (V-U)
- BIF501 035 Partial Digest Problem (V-U)
- BIF501 037 Partial Digest Algorithm I (V-U)
- BIF501 036 Practical Restriction Mapping Algorithm (V-U)
- BIF501 038 Partial Digest Algorithm II (V-U)
- BIF501 039 Regulatory Motifs in DNA Sequences (V-U)
- BIF501 041 Profiles II (V-U)
- BIF501 040 Profiles I (V-U)
- BIF501 042 Profiles III (V-U)
- BIF501 043 Motif Finding Problem I (V-U)
- BIF501 044 Motif Finding Problem II (V-U)
- BIF501 051 Bypass Algorithm (V-U)
- BIF501 045 Search Trees – Introduction (V-U)
- BIF501 047 Algorithm for Search Trees I (V-U)
- BIF501 052 Finding Motifs (V-U)
- BIF501 046 Search Trees – Best Alternative (V-U)
- BIF501 048 Algorithm for Search Trees II (V-U)
- BIF501 053 Simple Motif Search Algorithm (V-U)
- BIF501 055 Brute Force Median Search (V-U)
- BIF501 049 Next Vertex Algorithm (V-U)
- BIF501 054 Branch and bound Algorithm (V-U)
- BIF501 056 Genome Rearrangements (V-U)
- BIF501 050 What is an algorithm (V-U)
- BIF501 057 A greedy approach to motif finding (V-U)
- BIF501 058 The Power of DNA Sequence Comparison (V-U)
- BIF501 059 Brute Force vs Greedy Algorithm (V-U)
- BIF501 061 Edit Distance (V-U)
- BIF501 060 Sequence Similarity (V-U)
- BIF501 062 Alignment (V-U)
- BIF501 076 Gene Prediction II (V-U)
- BIF501 063 Edit Graph I (V-U)
- BIF501 064 Edit Graph II (V-U)
- BIF501 065 Longest Common Sequences I (V-U)
- BIF501 077 one Approach for Gene Prediction (V-U)
- BIF501 079 Statistical Approach to Gene Prediction (V-U)
- BIF501 066 Recurrence for LCS problem (V-U)
- BIF501 078 Second Approach for Gene Prediction (V-U)
- BIF501 068 Scoring Alignments I (V-U)
- BIF501 080 Statistical Approach to Gene Prediction (V-U)
- BIF501 067 Algorithm for LCS (V-U)
- BIF501 069 Scoring Alignments II (V-U)
- BIF501 081 Statistical Approach to Gene Prediction (V-U)
- BIF501 070 PAM matrix (V-U)
- BIF501 082 Similarity based Approached to Gene Prediction (V-U)
- BIF501 071 Local Sequence Alignment I (V-U)
- BIF501 083 Similarity based Approached to Gene Prediction (V-U)
- BIF501 073 Local Alignment Problem (V-U)
- BIF501 085 ORF Finders (V-U)
- BIF501 072 Local Sequence Alignment II (V-U)
- BIF501 084 ORF Prediction (V-U)
- BIF501 074 Progressive Multiple Alignment (V-U)
- BIF501 086 TSS Prediction (V-U)
- BIF501 075 Gene Prediction I (V-U)
- BIF501 087 Prediction of Splice Junctions (V-U)
- BIF501 088 Prediction of Exons (V-U)
- BIF501 090 Pattern Finding in a Genome (V-U)
- BIF501 089 Annotation of assembled Genome (V-U)
- BIF501 091 Pattern Finding Algorithms (V-U)
- BIF501 092 Brute Force Approach (V-U)
- BIF501 093 Knuth-Morris-Pratt Algorithm (V-U)
- BIF501 095 KMP:Matcher (V-U)
- BIF501 094 KMP: Prefix function (V-U)
- BIF501 096 Scoring Schemes (V-U)
- BIF501 097 Subsitution Matrices (V-U)
- BIF501 098 Optimal Alignment Methods (V-U)
- BIF501 099 Needleman-Wunsch Algorithm (V-U)
- BIF501 100 Smith-Waterman Algorithm (V-U)
- BIF501 101 DNA Sequencing 1 (V-U)
- BIF501 102 DNA Sequencing 11 (V-U)
- BIF501 104 sequencing by hybridization (V-U)
- BIF501 103 DNA Arrays (V-U)
- BIF501 105 Fragment Assemly in DNA sequencing (V-U)
- BIF501 106 Strategy for Sequencing (V-U)
- BIF501 108 computational protein sequencing (V-U)
- BIF501 107 protein sequence and identification (V-U)
- BIF501 109 Mass spectrophotometry (V-U)
- BIF501 110 The peptide sequencing problem 1 (V-U)
- BIF501 127 Introduction to Homology modelling (V-U)
- BIF501 111 The peptide sequencing problem 11 (V-U)
- BIF501 126 Summary of Visualization, Classification and Prediction (V-U)
- BIF501 112 protein identification via database search (V-U)
- BIF501 128 Homology, Paralogy and Orthology (V-U)
- BIF501 113 Modified Protein Identification Problems (V-U)
- BIF501 129 Workflow for Structural Modelling (V-U)
- BIF501 114 Protein Structure Prediction (V-U)
- BIF501 115 Predicting Secondary Structures (V-U)
- BIF501 130 Seven Steps to Homology Modelling -I (V-U)
- BIF501 116 Introduction to Chou Fasman Algorithm (V-U)
- BIF501 131 Seven Steps to Homology Modelling -II (V-U)
- BIF501 117 2’ Structures in Chou Fasman Algorithm (V-U)
- BIF501 132 Seven Steps to Homology Modelling -III (V-U)
- BIF501 118 Chou Fasman Algorithm – I (V-U)
- BIF501 133 Seven Steps to Homology Modelling -IV (V-U)
- BIF501 135 Seven Steps to Homology Modelling -VI (V-U)
- BIF501 119 Chou Fasman Algorithm – II (V-U)
- BIF501 134 Seven Steps to Homology Modelling -V (V-U)
- BIF501 121 Chou Fasman Algorithm – IV (V-U)
- BIF501 136 Modeller for Homology Modelling (V-U)
- BIF501 120 Chou Fasman Algorithm – III (V-U)
- BIF501 122 Chou Fasman Algorithm – Flowchart (V-U)
- BIF501 137 Fold Recognition/Threading I (V-U)
- BIF501 123 Chou Fasman Algorithm – Flowchart I… (V-U)
- BIF501 138 Fold Recognition/Threading II (V-U)
- BIF501 124 Chou Fasman Algorithm – Flowchart I… (V-U)
- BIF501 139 Fold Recognition/Threading III (V-U)
- BIF501 125 Chou Fasman Algorithm – Improvements (V-U)
- BIF501 140 Online Tools for Threading – iTasse… (V-U)
- BIF501 142 3D-1D Bowie Algorithm (V-U)
- BIF501 141 Advantages and Disadvantages of Threading (V-U)
- BIF501 143 Introduction to Ab-Initio Modelling (V-U)
- BIF501 144 Rationale of Ab Initio Modelling (V-U)
- BIF501 145 Strategies for Ab Initio Modelling (V-U)
- BIF501 147 Local versus Global Minima (V-U)
- BIF501 146 Energy States of Folded Proteins (V-U)
- BIF501 148 Pros and Cons of Ab Initio Modelling (V-U)
- BIF501 149 Summary of Structural Modelling – I (V-U)
- BIF501 150 Summary of Structural Modelling – II (V-U)
- BIF501 151 Summary of Structural Modelling – III (V-U)
- BIF501 152 Review of Sequence Analysis (V-U)
- BIF501 153 Review of Phylogenetics (V-U)
- BIF501 154 Review of Protein Sequencing (V-U)
- BIF501 155 Review of RNA Structure Prediction (V-U)
- BIF501 157 Review of Homology Modelling (V-U)
- BIF501 156 Review of Protein Structures (V-U)
- BIF501 158 Conclusions from this Course (V-U)
- BIF501 159 Advanced Follow-up Courses (V-U)
- BIF501 176 DNA profile generation (V-U)
- BIF501 160 Careers in Bioinformatics (V-U)
- BIF501 177 Introduction to Drug Discovery (V-U)
- BIF501 161 RNA Structure (V-U)
- BIF501 163 RNA Secondary Structure Prediction (V-U)
- BIF501 178 Drug Discovery Applications (V-U)
- BIF501 162 RNA Secondary Structure (V-U)
- BIF501 180 Pharmacogenetics applications (V-U)
- BIF501 164 RNASeq (V-U)
- BIF501 179 Pharmacogenetics (V-U)
- BIF501 181 Drug Discovery Pipeline (V-U)
- BIF501 165 RNASeq Normalization (V-U)
- BIF501 167 Associate Rules (V-U)
- BIF501 182 Drug Discovery Methods (V-U)
- BIF501 166 Neural Networks (V-U)
- BIF501 168 Clustering (V-U)
- BIF501 183 Drug Discovery (V-U)
- BIF501 169 Machine Learning (V-U)
- BIF501 184 Biomedical annotated (V-U)
- BIF501 185 Steps for Creation of Biomedical Co… (V-U)
- BIF501 170 ML Concepts (V-U)
- BIF501 186 Target discovery strategy (V-U)
- BIF501 171 ML Applications (V-U)
- BIF501 188 Target validation (V-U)
- BIF501 173 Advantages of Bioinformatics in for… (V-U)
- BIF501 187 Strategies To Identify Possible Drug Targets (V-U)
- BIF501 172 Forensic Science (V-U)
- BIF501 189 Lead identification (V-U)
- BIF501 174 Methods used in DNA profiling (V-U)
- BIF501 190 Lead optimization (V-U)
- BIF501 175 DNA profile (V-U)