expected length

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Lecture 7: From alignment graphs to formal dynamic programmingFundamental Algorithms in BioinformaticsNotes
   +Watch later
2. 2▶Lecture 14: BLAST IFundamental Algorithms in BioinformaticsNotes
   +Watch later
3. 3▶Lecture 13: Probability of a complete query match in a databaseFundamental Algorithms in BioinformaticsNotes
   +Watch later
4. 4▶Lecture 12: Expected longest common substring IIFundamental Algorithms in BioinformaticsNotes
   +Watch later
5. 5▶Lecture 8: Sequence alignment using dynamic programming - continuedFundamental Algorithms in BioinformaticsNotes
   +Watch later
6. 6▶Lecture 9: Local sequence alignmentFundamental Algorithms in BioinformaticsNotes
   +Watch later
7. 7▶Lecture 6: Computing similarity using an alignment graphFundamental Algorithms in BioinformaticsNotes
   +Watch later
8. 8▶Lecture 11b: Expected Length of the Longest Common SubstringFundamental Algorithms in BioinformaticsNotes
   +Watch later
9. 9▶Lecture 10: End-gap-free alignment and whole-genome shotgun sequencingFundamental Algorithms in BioinformaticsNotes
   +Watch later
10. 10▶Lecture 4: Extending the model of sequence similarityFundamental Algorithms in BioinformaticsNotes
    +Watch later