Lecture 12: Expected longest common substring II
Fundamental Algorithms in Bioinformatics12 Tammi 2010

Lecture 12: Expected longest common substring II

Completion of the analysis of the expected length of the longest common substring in two random strings

Tämä jakso on lisätty Podme-palveluun avoimen RSS-syötteen kautta eikä se ole Podmen omaa tuotantoa. Siksi jakso saattaa sisältää mainontaa.

Jaksot(4)

Postscript: Where to go next

Postscript: Where to go next

Some suggestions of where the student can get more exposure to algorithms for bioinformatics and computational biology.

1 Helmi 20101min

Lecture 21: Uses of multiple sequence alignment

Lecture 21: Uses of multiple sequence alignment

Use of multiple sequence alignment to build a model of a set of biologically related sequences. Profiles, log-odds ratios.

22 Tammi 20104min

Lecture 7: From alignment graphs to formal dynamic programming

Lecture 7: From alignment graphs to formal dynamic programming

In this class, we move from the visual alignment graph to a purely symbolic treatment of how to compute sequence similarity and optimal alignment using dynamic programming.

7 Tammi 20108min