- What is a sequence alignment? (Pachter)
- What is the Needleman-Wunsch algorithm? (Pachter)
- What is the running time of this algorithm? (Pachter)
- How can this algorithm be used to find the maximal increasing subsequence of a permuation? (Pachter)
- Can you think of another way to find this maximal subsequence using the RSK algorithm? (Pachter)
- What is the running time of this algorithm? (Pachter)
- What is the Hammersley Clifford theorem from undirected graphical models? (Song)
- about the Conditional Independence statements, what is the smallest subset of statements needed to describe the graph? (Song)
- How do you find the marginalization of one of the variables? Ans: junction-tree algorithm, sum-product algorithm. (Song)