Virtual University

BIF401 028 Introduction to Alignment Approaches (V-U)

BIF401 030 Aligning In-dels (V-U)

BIF401 029 Why local alignments? (V-U)

BIF401 031 Aligning Mutations in Sequences (V-U)

BIF401 032 Introduction to Dynamic Programming (V-U)

BIF401 034 Dynamic Programming Methodology (V-U)

BIF401 033 Dynamic Programming – Essentials (V-U)

BIF401 035 Needleman Wunsh Algorithm-I (V-U)

BIF401 036 Needleman Wunsh Algorithm-II (V-U)

BIF401 037 Needleman Wunsh Algorithm-III (V-U)

BIF401 039 Backtracking Alignments (V-U)

BIF401 038 Needleman Wunsh Algorithm-Example (V-U)

BIF401 040 Revisiting Global and Local Alignment (V-U)

BIF401 041 Overlap Matches (V-U)

BIF401 042 Example of Overlap Matches (V-U)

BIF401 043 Moving From global to local alignment (V-U)

BIF401 045 Example of Smith Waterman Algorithm (V-U)

BIF401 044 Smith Waterman Algorithm (V-U)

BIF401 046 Repeated Alignments (V-U)

BIF401 047 Exmaple of repeated alignment (V-U)

BIF401 049 Introduction to Scoring Alignments (V-U)

BIF401 048 Review of Traceback Strategies for … (V-U)

BIF401 050 Measuring alignments by scoring (V-U)

BIF401 051 Scoring matrices (V-U)

BIF401 052 Deriving scoring matrices (V-U)