Bioinformatics AlgorithmsAn Active Learning Approach

Lessons in this chapter

  1. 2.1Do We Have a "Clock" Gene?Circadian Clock Genes and Regulatory Motifs
  2. 2.2Motif Finding is More Difficult Than You ThinkMotif Finding and the Implanted Motif Problem
  3. 2.3Scoring MotifsScoring Motifs: Profile Matrices, Consensus Strings, Entropy and Motif Logos
  4. 2.4From Motif Finding to Finding a Median StringThe Motif Finding Problem and the Median String Problem
  5. 2.5Greedy Motif SearchGreedy Motif Search and Profile-Most Probable k-mers
  6. 2.6Motif Finding Meets Oliver CromwellPseudocounts and Laplace's Rule of Succession in Motif Finding
  7. 2.7Randomized Motif SearchRandomized Motif Search: A Randomized Algorithm for Finding Motifs
  8. 2.8How Can a Randomized Algorithm Perform So Well?Why Randomized Motif Search Works So Well
  9. 2.9Gibbs SamplingGibbs Sampling for Motif Finding
  10. 2.10Gibbs Sampling in ActionGibbs Sampling in Action: A Worked Motif Finding Example
  11. EpilogueHow Does Tuberculosis Hibernate?Motif Finding in Tuberculosis: How Does TB Hibernate?
Solve the code challengesEvery problem in this chapter, autograded, in the interactive text Lecture videosThe full Chapter 2 playlist

Stuck on something? See the Chapter 2 learner FAQ.