Multiple Sequence Alignment
Finding missense variants that help explain the differences in dentition in Neanderthals and modern humans using a multiple sequence alignment (R seqinr and msa package).
Greedy Algorithm and Sequence Assembly
The greedy algorithm can be used to assemble longer sequences from shorter fragments from sequencing, not always giving the optimal result.
Hidden Markov Model
In a hidden markov model, the markov chain is hidden, we can only observe outcome values. Therefore, additional concepts such as observed states and emission probabilities are explained.
Markov Chains
Markov chains are a succession of random events. Using the example of chutes and ladders, concepts such as states, initial probability, and transition matrix are explained.
