Об этом курсе: We will learn computational methods -- algorithms and data structures -- for analyzing DNA sequencing data. We will learn a little about DNA, genomics, and how DNA sequencing is used. We will use Python to implement key algorithms and data structures and to analyze real genomes and DNA sequencing datasets.
Автор: Johns Hopkins University
Преподаватели: Ben Langmead, PhD, Assistant Professor
Computer Science
Преподаватели: Jacob Pritt
Department of Computer Science
| Основные сведения | Курс 4 из 8 — Genomic Data Science Specialization |
| Язык | English |
| Как пройти курс | Чтобы пройти курс, выполните все оцениваемые задания. |
| Оценки пользователей |
Программа курса
НЕДЕЛЯ 1
DNA sequencing, strings and matching
This module we begin our exploration of algorithms for analyzing DNA sequencing data. We'll discuss DNA sequencing technology, its past and present, and how it works.
19 видео, 7 материала для самостоятельного изучения
- Reading: Welcome to Algorithms for DNA Sequencing
- Reading: Pre Course Survey
- Reading: Syllabus
- Reading: Setting up Python (and Jupyter)
- Reading: Getting slides and notebooks
- Reading: Using data files with Python programs
- Видео: Lecture: Why study this?
- Видео: Lecture: DNA sequencing past and present
- Видео: Lecture: Genomes as strings, reads as substrings
- Видео: Lecture: String definitions and Python examples
- Видео: Practical: String basics
- Видео: Practical: Manipulating DNA strings
- Видео: Practical: Downloading and parsing a genome
- Видео: Lecture: How DNA gets copied
- Видео: Optional lecture: How second-generation sequencers work
- Видео: Optional lecture: Sequencing errors and base qualities
- Видео: Lecture: Sequencing reads in FASTQ format
- Видео: Practical: Working with sequencing reads
- Видео: Practical: Analyzing reads by position
- Видео: Lecture: Sequencers give pieces to genomic puzzles
- Видео: Lecture: Read alignment and why it's hard
- Видео: Lecture: Naive exact matching
- Видео: Practical: Matching artificial reads
- Видео: Practical: Matching real reads
- Reading: Programming Homework 1 Instructions (Read First)
Оцениваемый: Module 1
Оцениваемый: Programming Homework 1
НЕДЕЛЯ 2
Preprocessing, indexing and approximate matching
In this module, we learn useful and flexible new algorithms for solving the exact and approximate matching problems. We'll start by learning Boyer-Moore, a fast and very widely used algorithm for exact matching
15 видео, 1 материал для самостоятельного изучения
- Видео: Lecture: Boyer-Moore basics
- Видео: Lecture: Boyer-Moore: putting it all together
- Видео: Lecture: Diversion: Repetitive elements
- Видео: Practical: Implementing Boyer-Moore
- Видео: Lecture: Preprocessing
- Видео: Lecture: Indexing and the k-mer index
- Видео: Lecture: Ordered structures for indexing
- Видео: Lecture: Hash tables for indexing
- Видео: Practical: Implementing a k-mer index
- Видео: Lecture: Variations on k-mer indexes
- Видео: Lecture: Genome indexes used in research
- Видео: Lecture: Approximate matching, Hamming and edit distance
- Видео: Lecture: Pigeonhole principle
- Видео: Practical: Implementing the pigeonhole principle
- Reading: Programming Homework 2 Instructions (Read First)
Оцениваемый: Module 2
Оцениваемый: Programming Homework 2
НЕДЕЛЯ 3
Edit distance, assembly, overlaps
This week we finish our discussion of read alignment by learning about algorithms that solve both the edit distance problem and related biosequence analysis problems, like global and local alignment.
13 видео, 1 материал для самостоятельного изучения
- Видео: Lecture: Solving the edit distance problem
- Видео: Lecture: Using dynamic programming for edit distance
- Видео: Practical: Implementing dynamic programming for edit distance
- Видео: Lecture: A new solution to approximate matching
- Видео: Lecture: Meet the family: global and local alignment
- Видео: Practical: Implementing global alignment
- Видео: Lecture: Read alignment in the field
- Видео: Lecture: Assembly: working from scratch
- Видео: Lecture: First and second laws of assembly
- Видео: Lecture: Overlap graphs
- Видео: Practical: Overlaps between pairs of reads
- Видео: Practical: Finding and representing all overlaps
- Reading: Programming Homework 3 Instructions (Read First)
Оцениваемый: Module 3
Оцениваемый: Programming Homework 3
НЕДЕЛЯ 4
Algorithms for assembly
In the last module we began our discussion of the assembly problem and we saw a couple basic principles behind it. In this module, we'll learn a few ways to solve the alignment problem.
13 видео, 1 материал для самостоятельного изучения
- Видео: Lecture: The shortest common superstring problem
- Видео: Practical: Implementing shortest common superstring
- Видео: Lecture: Greedy shortest common superstring
- Видео: Practical: Implementing greedy shortest common superstring
- Видео: Lecture: Third law of assembly: repeats are bad
- Видео: Lecture: De Bruijn graphs and Eulerian walks
- Видео: Practical: Building a De Bruijn graph
- Видео: Lecture: When Eulerian walks go wrong
- Видео: Lecture: Assemblers in practice
- Видео: Lecture: The future is long?
- Видео: Lecture: Computer science and life science
- Видео: Lecture: Thank yous
- Reading: Post Course Survey
Оцениваемый: Programming Homework 4
Оцениваемый: Module 4
Часто задаваемые вопросы
Как это работает
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Авторы
Johns Hopkins University
The mission of The Johns Hopkins University is to educate its students and cultivate their capacity for life-long learning, to foster independent and original research, and to bring the benefits of discovery to the world.
Стоимость
| Приобрести курс | |
|---|---|
| Получить доступ к материалам курса | Доступен |
| Получить доступ к оцениваемым материалам курса | Доступен |
| Получить итоговую оценку | Доступен |
| Получите сертификат о прохождении курса, ссылкой на который можно делиться с другими людьми | Доступен |
Рейтинги и отзывы
It is well explained. More space to programming practical exercise is suggested.Very intriguing Programming Homework! You have to apply all the python knowledge you have learned so far and also the one you have still to learn :)
Very well prepared, from basics up to all commonly used techniques in bioinformatics. Prerequisites in Python is a plus, but not even necessary.
it's really a helpful course, and it would show you the basic algorithms of the software we are using today.
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
This is more of my area... just starting the first videos and I'm already excited.