Содержание курса
6
разделов
118
уроков
43
теста
79
задач
84 ч.
обн. 1 год назад
Where in the Genome Does DNA Replication Begin?
23 урока
1.
A Journey of a Thousand Miles. . .
↗
2.
Hidden Messages in the Replication Origin
↗
3.
Some Hidden Messages are More Surprising than Others
↗
4.
An Explosion of Hidden Messages
↗
5.
The Simplest Way to Replicate DNA
↗
6.
Asymmetry of Replication
↗
7.
Peculiar Statistics of the Forward and Reverse Half-Strands
↗
8.
Some Hidden Messages are More Elusive than Others
↗
9.
A Final Attempt at Finding DnaA Boxes in E. coli
↗
10.
Epilogue: Complications in ori Predictions
↗
11.
CS: The Frequency Array
↗
12.
CS: Converting Patterns to Numbers and Vice-Versa
↗
13.
CS: Finding Frequent Words by Sorting
↗
14.
CS: Solving the Clump Finding Problem
↗
15.
CS: Solving the Frequent Words with Mismatches Problem
↗
16.
CS: Generating the Neighborhood of a String
↗
17.
CS: Finding Frequent Words with Mismatches by Sorting
↗
18.
Detour: Big-O Notation
↗
19.
Detour: Probabilities of Patterns in a String
↗
20.
Detour: The Most Beautiful Experiment in Biology
↗
21.
Detour: Directionality of DNA Strands
↗
22.
Detour: The Towers of Hanoi
↗
23.
Detour: The Overlapping Words Paradox
↗
Which DNA Patterns Play the Role of Molecular Clocks?
17 уроков
1.
Do We Have a "Clock" Gene?
↗
2.
Motif Finding Is More Difficult Than You Think
↗
3.
Scoring Motifs
↗
4.
From Motif Finding to Finding a Median String
↗
5.
Greedy Motif Search
↗
6.
Motif Finding Meets Oliver Cromwell
↗
7.
Randomized Motif Search
↗
8.
How Can a Randomized Algorithm Perform So Well?
↗
9.
Gibbs Sampling
↗
10.
Gibbs Sampling in Action
↗
11.
Epilogue: How Does Tuberculosis Hibernate?
↗
12.
CS: Solving the Median String Problem
↗
13.
Detour: Gene Expression
↗
14.
Detour: DNA Arrays
↗
15.
Detour: Buffon's Needle
↗
16.
Detour: Complications in Motif Finding
↗
17.
Detour: Relative entropy
↗
How Do We Assemble Genomes?
20 уроков
1.
Exploding Newspapers
↗
2.
The String Reconstruction Problem
↗
3.
String Reconstruction as a Walk in the Overlap Graph
↗
4.
Another Graph for String Reconstruction
↗
5.
Walking in the de Bruijn Graph
↗
6.
The Seven Bridges of Königsberg
↗
7.
Euler's Theorem
↗
8.
From Euler's Theorem to an Algorithm for Finding Eulerian Cycles
↗
9.
Assembling Genomes from Read-Pairs
↗
10.
Epilogue: Genome Assembly Faces Real Sequencing Data
↗
11.
CS: The Effect of Gluing on the Adjacency Matrix
↗
12.
CS: Reconstructing a String from the Paired de Bruijn Graph
↗
13.
CS: Maximal Non-Branching Paths in a Graph
↗
14.
Detour: A Short History of DNA Sequencing Technologies
↗
15.
Detour: Repeats in the Human Genome
↗
16.
Detour: An Introduction to Graphs
↗
17.
Detour: Hamilton's Icosian Game
↗
18.
Detour: Tractable and Intractable Problems
↗
19.
Detour: From Euler to Hamilton to de Bruijn
↗
20.
Detour: The Seven Bridges of Kaliningrad
↗
How Do We Sequence Antibiotics?
19 уроков
1.
The Discovery of Antibiotics
↗
2.
How Do Bacteria Make Antibiotics?
↗
3.
Dodging the Central Dogma of Molecular Biology
↗
4.
Sequencing Antibiotics by Shattering Them into Pieces
↗
5.
A Brute Force Algorithm for Cyclopeptide Sequencing
↗
6.
A Branch-and-Bound Algorithm for Cyclopeptide Sequencing
↗
7.
Mass Spectrometry Meets Golf
↗
8.
From 20 to More than 100 Amino Acids
↗
9.
The Spectral Convolution Saves the Day
↗
10.
Epilogue: From Simulated to Real Spectra
↗
11.
CS: Generating the Theoretical Spectrum of a Peptide
↗
12.
CS: How Fast is CyclopeptideSequencing?
↗
13.
CS: Trimming the Peptide Leaderboard
↗
14.
Detour: Gause and Lysenkoism
↗
15.
Detour: The Discovery of Codons
↗
16.
Detour: Quorum Sensing
↗
17.
Detour: Molecular Mass
↗
18.
Detour: Selenocysteine and Pyrrolysine
↗
19.
Detour: Pseudo-polynomial Algorithm for the Turnpike Problem
↗
How Do We Compare Biological Sequences?
21 урок
1.
Cracking the Non-Ribosomal Code
↗
2.
Introduction to Sequence Alignment
↗
3.
The Manhattan Tourist Problem
↗
4.
Sequence Alignment is the Manhattan Tourist Problem in Disguise
↗
5.
An Introduction to Dynamic Programming: The Change Problem
↗
6.
The Manhattan Tourist Problem Revisited
↗
7.
From Manhattan to an Arbitrary DAG
↗
8.
Backtracking in the Alignment Graph
↗
9.
Scoring Alignments
↗
10.
From Global to Local Alignment
↗
11.
The Changing Faces of Sequence Alignment
↗
12.
Penalizing Insertions and Deletions in Sequence Alignment
↗
13.
Space-Efficient Sequence Alignment
↗
14.
Epilogue: Multiple Sequence Alignment
↗
15.
Detour: Fireflies and the Non-Ribosomal Code
↗
16.
Detour: The Towers of Hanoi
↗
17.
Detour: Finding an LCS without Building a City
↗
18.
Detour: Constructing a Topological Ordering
↗
19.
Detour: PAM Scoring Matrices
↗
20.
Detour: Divide-and-Conquer Algorithms
↗
21.
Detour: Scoring Multiple Alignments
↗
Are There Fragile Regions in the Human Genome?
18 уроков
1.
Of Mice and Men
↗
2.
The Random Breakage Model of Chromosome Evolution
↗
3.
Sorting by Reversals
↗
4.
A Greedy Algorithm for Sorting by Reversals
↗
5.
Breakpoints
↗
6.
Rearrangements in Tumor Genomes
↗
7.
From Unichromosomal to Multichromosomal Genomes
↗
8.
Breakpoint Graphs
↗
9.
Computing the 2-Break Distance
↗
10.
Rearrangement Hotspots in the Human Genome
↗
11.
Epilogue: Synteny Block Construction
↗
12.
CS: From Genomes to the Breakpoint Graph
↗
13.
CS: Solving the 2-Break Sorting Problem
↗
14.
Detour: Why is the Gene Content of X Chromosomes So Conserved?
↗
15.
Detour: Discovery of Genome Rearrangements
↗
16.
Detour: The Exponential Distribution
↗
17.
Detour: Bill Gates and David X. Cohen Flip Pancakes
↗
18.
Detour: Sorting Linear Permutations by Reversals
↗