Bioinformatics Computing II (V-U)

BIF602 226 efficiency of DNA Computing (V-U)

BIF602 227 success of DNA Computing (V-U)

BIF602 228 (V-U)

BIF602 230 (V-U)

BIF602 229 (V-U)

BIF602 231 (V-U)

BIF602 232 (V-U)

BIF602 233 Caveats (V-U)

BIF602 234 Application of DNA Computing (V-U)

BIF602 236 Advantages of of DNA Computing (V-U)

BIF602 235 (V-U)

BIF602 237 (V-U)

BIF602 238 String matching (V-U)

BIF602 239 Aproximate String matching (V-U)

BIF602 241 sequence aligment (V-U)

BIF602 240 Dynamic programming (V-U)

BIF602 242 pairwise sequence aligment (V-U)

BIF602 243 global vs local alignment (V-U)

BIF602 244 global alignment fundamentals (V-U)

BIF602 246 Trace Back (V-U)

BIF602 245 Matrix filling (V-U)

BIF602 247 GSA (V-U)

BIF602 248 Local Alignement (V-U)

BIF602 249 Matrix filling in LSA (V-U)

BIF602 250 Trace Back in LSA (V-U)