Сколько стоит курс «Bioinformatics Algorithms (Part 2)»?

Курс «Bioinformatics Algorithms (Part 2)» доступен бесплатно.

Сколько времени занимает прохождение курса «Bioinformatics Algorithms (Part 2)»?

Прохождение курса «Bioinformatics Algorithms (Part 2)» занимает примерно 62 часов.

Какой рейтинг у курса «Bioinformatics Algorithms (Part 2)»?

Курс имеет рейтинг 0.0 из 5 на основе 0 отзывов. На курсе обучается 3 429 учеников.

Где можно пройти курс «Bioinformatics Algorithms (Part 2)»?

Курс доступен на образовательной платформе Stepik по адресу stepik.org/course/97.

Курс на Stepik

Бесплатно

Bioinformatics Algorithms (Part 2) ★ 0.000

Name: Bioinformatics Algorithms (Part 2)
Availability: InStock
Rating: 0 (0 reviews)

Открыть на
STEPIK.ORG

Interactive Textbook accompanying https://www.coursera.org/course/bioinformatics2.

Показатель	Текущие показатели		Рост
Показатель	Значение	🏆 Рейтинг	3 дн	7 дн	30 дн
Учеников на курсе	3 429
Сертификатов выдано	0
Отзывов получено	0
Рейтинг курса	0.000
Количество уроков	66
Количество квизов	5
Количество задач с кодом	51
Время прохождения курса	62 ч.	—
Обновления курса	—	—
Дата публикации курса	11 лет назад	—	—	—	—
Последнее обновление	4 года назад	—	—	—	—

Содержание курса

Разделы в курсе «Bioinformatics Algorithms (Part 2)»

12 разделов Уроки в курсе «Bioinformatics Algorithms (Part 2)»

66 уроков Тесты в курсе «Bioinformatics Algorithms (Part 2)»

5 тестов Задачи в курсе «Bioinformatics Algorithms (Part 2)»

51 задача Время прохождения курса «Bioinformatics Algorithms (Part 2)»

62 ч.

обн. 4 года назад

How Do We Locate Disease-Causing Mutations? (Week 1/3)

11 уроков

1. What Causes Ohdo Syndrome? ↗

2. Introduction to Multiple Pattern Matching ↗

3. Herding Patterns into a Trie ↗

4. Preprocessing the Genome Instead ↗

5. Suffix Trees ↗

6. CS: Constructing a Suffix Tree ↗

7. CS: Maximal Non-Branching Paths in a Graph ↗

8. CS: Solving the Longest Shared Substring Problem ↗

9. Detour: The Reference Human Genome ↗

10. Detour: Rearrangements, Insertions, & Deletions in Human Genomes ↗

11. Detour: The Aho-Corasick Algorithm ↗

How Do We Locate Disease-Causing Mutations? (Week 2/3)

6 уроков

1. Suffix Arrays ↗

2. The Burrows-Wheeler Transform ↗

3. A First Attempt at Inverting the Burrows-Wheeler Transform ↗

4. The First-Last Property and Burrows-Wheeler Inversion ↗

5. Pattern Matching with the Burrows-Wheeler Transform ↗

6. Detour: Suffix Arrays and Suffix Trees ↗

How Do We Locate Disease-Causing Mutations? (Week 3/3)

5 уроков

1. Speeding Up Burrows-Wheeler Pattern Matching ↗

2. Where are the Matched Patterns? ↗

3. Burrows and Wheeler Set Up Checkpoints ↗

4. Epilogue: Mismatch-Tolerant Read Mapping ↗

5. CS: Partial Suffix Array Construction ↗

Which Animal Gave Us SARS? (Week 1/3)

9 уроков

1. The Fastest Outbreak ↗

2. Transforming Distance Matrices into Evolutionary Trees ↗

3. Toward An Algorithm for Distance-Based Phylogeny Construction ↗

4. Additive Phylogeny ↗

5. Detour: When Did HIV Jump from Primates to Humans? ↗

6. Detour: An Introduction to Graphs ↗

7. Detour: Searching for a Tree Fitting a Distance Matrix ↗

8. Detour: The Four Point Condition ↗

9. Detour: Did Bats Give Us SARS? ↗

Which Animal Gave Us SARS? (Week 2/3)

5 уроков

1. Using Least Squares to Construct Approximate Phylogenies ↗

2. Ultrametric Evolutionary Trees ↗

3. The Neighbor-Joining Algorithm ↗

4. Detour: Why Does the Neighbor-Joining Algorithm Work? ↗

5. Detour: Computing Limb Lengths in the Neighbor-Joining Algorithm ↗

Which Animal Gave Us SARS? (Week 3/3)

6 уроков

1. Character-Based Tree Reconstruction ↗

2. The Small Parsimony Problem ↗

3. The Large Parsimony Problem ↗

4. Epilogue: Evolutionary Trees Fight Crime ↗

5. Detour: Giant Panda: Bear or Raccoon? ↗

6. Detour: Where Did Humans Come From? ↗

How Did Yeast Become a Wine-Maker? (Week 1/2)

12 уроков

1. An Evolutionary History of Wine-Making ↗

2. Identifying Genes Responsible for the Diauxic Shift ↗

3. Introduction to Clustering ↗

4. The Good Clustering Principle ↗

5. Clustering as an Optimization Problem ↗

6. Farthest First Traversal ↗

7. k-Means Clustering ↗

8. The Lloyd Algorithm ↗

9. Clustering Genes Implicated in the Diauxic Shift ↗

10. Detour: Measuring Gene Expression ↗

11. Detour: Microarrays ↗

12. Detour: Proof of the Center of Gravity Theorem ↗

How Did Yeast Become a Wine-Maker? (Week 2/2)

8 уроков

1. Limitations of k-means Clustering ↗

2. From Coin Flipping to k-Means Clustering ↗

3. Making Soft Decisions in Coin Flipping ↗

4. Soft k-Means Clustering ↗

5. Hierarchical Clustering ↗

6. Epilogue: Clustering Tumor Samples ↗

7. Detour: Gene Expression Matrix to a Distance/Similarity Matrix ↗

8. Detour: Clustering and Corrupted Cliques ↗

Why Have Biologists Still Not Developed an HIV Vaccine? (Wk 1/2)

1 урок

1. Hidden Markov Models Code Challenges (Week 1) ↗

Why Have Biologists Still Not Developed an HIV Vaccine? (Wk 2/2)

1 урок

1. Hidden Markov Models Code Challenges (Week 2) ↗

Was T. rex Just a Big Chicken? (Week 1/2)

1 урок

1. Proteomics Code Challenges Week 1 ↗

Was T. rex Just a Big Chicken? (Week 2/2)

1 урок

1. Proteomics Code Challenges Week 2 ↗