Virtual University

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)