25. Three problems related to hidden Markov models

27. The Viterbi algorithm

26. The forward and backward algorithms

24. Markov models and hidden Markov models

23. Performing text search using Burrows-Wheeler transform

22. Properties of Burrows-Wheeler transform

21. Suffix array and Burrows-Wheeler transform

20. Demonstration of the Ukkonen’s algorithm

19. Constructing a suffix tree in linear time

18. Constructing a suffix tree in super-linear time

17. Suffix tree

16. Suffix trie

15. Short-read alignment

14. Neighbor joining

13. UPGMA

12. Maximum likelihood for phylogenetic tree reconstruction

11. Mutation model

10. Maximum parsimony for phylogenetic tree reconstruction (II)

09. Maximum parsimony for phylogenetic tree reconstruction (I)

07. What are phylogenetic trees

08. The phylogenetic tree reconstruction problem

05. Using dynamic programming to perform global alignment - Traceback and general scoring schemes

06. Using dynamic programming to perform local alignment

04. Using dynamic programming to perform global alignment - basics

03. Principles of dynamic programming

02. How difficult is sequence alignment?

01. What is sequence alignment?