Содержание курса
1. Where in the Genome Does DNA Replication Begin? (Ch. 1, Wk 1/2)
9 уроков
296 768
61 905
375м
2917
Закрытый
1.1
A Journey of a Thousand Miles. . .
↗
88 333
0
6м 14с
1707
Открытый
1.2
Hidden Messages in the Replication Origin
↗
64 532
6 615
71м 33с
725
Закрытый
1.3
Some Hidden Messages are More Surprising than Others
↗
35 545
13 219
40м 25с
200
Закрытый
1.4
An Explosion of Hidden Messages
↗
29 761
7 569
83м 26с
134
Закрытый
1.5
CS: The Frequency Array
↗
19 958
5 809
80м 16с
39
Закрытый
1.6
CS: Converting Patterns to Numbers and Vice-Versa
↗
14 917
5 146
24м 52с
49
Закрытый
1.7
CS: Finding Frequent Words by Sorting
↗
13 484
10 909
2м 37с
37
Закрытый
1.8
CS: Solving the Clump Finding Problem
↗
14 859
10 921
2м 26с
43
Закрытый
1.9
Week 1 Code-Graded Problems (Optional)
↗
15 379
1 717
66м 22с
-17
2. Where in the Genome Does DNA Replication Begin? (Ch. 1, Wk 2/2)
9 уроков
147 858
81 832
271м
530
Закрытый
2.1
The Simplest Way to Replicate DNA
↗
24 640
20 310
5м 39с
185
Закрытый
2.2
Asymmetry of Replication
↗
21 304
19 021
4м 51с
107
Закрытый
2.3
Peculiar Statistics of the Forward and Reverse Half-Strands
↗
20 444
3 951
49м 34с
60
Закрытый
2.4
Some Hidden Messages are More Elusive than Others
↗
19 208
3 144
164м 18с
39
Закрытый
2.5
A Final Attempt at Finding DnaA Boxes in E. coli
↗
15 987
13 334
3м 19с
49
Закрытый
2.6
Epilogue: Complications in ori Predictions
↗
14 705
3 443
15м 17с
48
Закрытый
2.7
CS: Solving the Frequent Words with Mismatches Problem
↗
10 150
4 604
3м 39с
27
Закрытый
2.8
CS: Generating the Neighborhood of a String
↗
13 130
5 735
27м 29с
11
Закрытый
2.9
CS: Finding Frequent Words with Mismatches by Sorting
↗
8 290
8 290
1м 4с
4
3. Which DNA Patterns Serve as Molecular Clocks? (Ch. 2, Wk 1/2)
8 уроков
79 355
44 257
416м
246
Закрытый
3.1
Do We Have a "Clock" Gene?
↗
13 340
12 172
4м 16с
101
Закрытый
3.2
Motif Finding Is More Difficult Than You Think
↗
12 320
6 492
86м 36с
62
Закрытый
3.3
Scoring Motifs
↗
11 180
4 701
36м 16с
76
Закрытый
3.4
From Motif Finding to Finding a Median String
↗
10 549
5 458
54м 30с
57
Закрытый
3.5
Greedy Motif Search
↗
10 149
5 659
145м 13с
-94
Закрытый
3.6
Motif Finding Meets Oliver Cromwell
↗
9 411
5 499
16м 12с
55
Закрытый
3.7
CS: Solving the Median String Problem
↗
8 061
3 481
28м 38с
15
Закрытый
3.8
Week 3 Code-Graded Problems (Optional)
↗
4 345
795
48м 30с
-26
4. Which DNA Patterns Serve as Molecular Clocks? (Ch. 2, Wk 2/2)
5 уроков
40 889
20 690
191м
15
Закрытый
4.1
Randomized Motif Search
↗
9 823
4 727
82м 36с
-33
Закрытый
4.2
How Can a Randomized Algorithm Perform So Well?
↗
8 201
2 894
22м 42с
22
Закрытый
4.3
Gibbs Sampling
↗
8 451
4 401
81м 56с
-33
Закрытый
4.4
Gibbs Sampling in Action
↗
7 554
6 589
3м 21с
26
Закрытый
4.5
Epilogue: How Does Tuberculosis Hibernate?
↗
6 860
2 079
4м 53с
33