Virtual University

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)