4.7
stars
785 ratings

Ben Langmead, PhD +1 more instructor

33,149 already enrolled

Offered By

Johns Hopkins University

About this Course

33,723 recent views

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.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Approx. 12 hours to complete

English

Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish

Skills you will gain

Bioinformatics Algorithms
Algorithms
Python Programming
Algorithms On Strings

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Approx. 12 hours to complete

English

Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish

Instructors

Instructor rating

4.78/5 (91 Ratings)

Ben Langmead, PhD

Jacob Pritt

Department of Computer Science

33,149 Learners

1 Course

Offered by

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.

Syllabus - What you will learn from this course

Content Rating96%(3,894 ratings)

Week

Week 1

4 hours to complete

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.

4 hours to complete

19 videos (Total 112 min), 7 readings, 2 quizzes

19 videos

Module 1 Introduction1m

Lecture: Why study this?4m

Lecture: DNA sequencing past and present3m

Lecture: Genomes as strings, reads as substrings5m

Lecture: String definitions and Python examples3m

Practical: String basics 7m

Practical: Manipulating DNA strings 7m

Practical: Downloading and parsing a genome 6m

Lecture: How DNA gets copied3m

Optional lecture: How second-generation sequencers work 7m

Optional lecture: Sequencing errors and base qualities 6m

Lecture: Sequencing reads in FASTQ format4m

Practical: Working with sequencing reads 11m

Practical: Analyzing reads by position 6m

Lecture: Sequencers give pieces to genomic puzzles5m

Lecture: Read alignment and why it's hard3m

Lecture: Naive exact matching10m

Practical: Matching artificial reads 6m

Practical: Matching real reads 7m

7 readings

Welcome to Algorithms for DNA Sequencing10m

Pre Course Survey10m

Syllabus10m

Setting up Python (and Jupyter)10m

Getting slides and notebooks10m

Using data files with Python programs10m

Programming Homework 1 Instructions (Read First)10m

2 practice exercises

Module 130m

Programming Homework 130m

Week

Week 2

3 hours to complete

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

3 hours to complete

15 videos (Total 114 min), 1 reading, 2 quizzes

15 videos

Week 2 Introduction 1m

Lecture: Boyer-Moore basics8m

Lecture: Boyer-Moore: putting it all together6m

Lecture: Diversion: Repetitive elements5m

Practical: Implementing Boyer-Moore 10m

Lecture: Preprocessing7m

Lecture: Indexing and the k-mer index10m

Lecture: Ordered structures for indexing8m

Lecture: Hash tables for indexing7m

Practical: Implementing a k-mer index 7m

Lecture: Variations on k-mer indexes9m

Lecture: Genome indexes used in research9m

Lecture: Approximate matching, Hamming and edit distance6m

Lecture: Pigeonhole principle6m

Practical: Implementing the pigeonhole principle 9m

1 reading

Programming Homework 2 Instructions (Read First)10m

2 practice exercises

Module 230m

Programming Homework 230m

Week

Week 3

3 hours to complete

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.

3 hours to complete

13 videos (Total 92 min), 1 reading, 2 quizzes

13 videos

Module 3 Introduction 1m

Lecture: Solving the edit distance problem12m

Lecture: Using dynamic programming for edit distance12m

Practical: Implementing dynamic programming for edit distance 6m

Lecture: A new solution to approximate matching9m

Lecture: Meet the family: global and local alignment10m

Practical: Implementing global alignment 8m

Lecture: Read alignment in the field4m

Lecture: Assembly: working from scratch2m

Lecture: First and second laws of assembly8m

Lecture: Overlap graphs8m

Practical: Overlaps between pairs of reads 4m

Practical: Finding and representing all overlaps 3m

1 reading

Programming Homework 3 Instructions (Read First)10m

2 practice exercises

Module 330m

Programming Homework 330m

Week

Week 4

3 hours to complete

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.

3 hours to complete

13 videos (Total 83 min), 1 reading, 2 quizzes

13 videos

Module 4 introduction 1m

Lecture: The shortest common superstring problem8m

Practical: Implementing shortest common superstring 4m

Lecture: Greedy shortest common superstring7m

Practical: Implementing greedy shortest common superstring 7m

Lecture: Third law of assembly: repeats are bad5m

Lecture: De Bruijn graphs and Eulerian walks8m

Practical: Building a De Bruijn graph 4m

Lecture: When Eulerian walks go wrong9m

Lecture: Assemblers in practice8m

Lecture: The future is long?9m

Lecture: Computer science and life science5m

Lecture: Thank yous 43s

1 reading

Post Course Survey10m

2 practice exercises

Programming Homework 430m

Module 430m

Reviews

4.7

188 reviews

5 stars
80.88%
4 stars
14.71%
3 stars
3.01%
2 stars
0.50%
1 star
0.88%

TOP REVIEWS FROM ALGORITHMS FOR DNA SEQUENCING

by MDNov 9, 2016

This was really fun. Really enjoyed the a-ha of the algorithms and the fun of solving the alignment and assembly problems. Feel mildly powerful after assembling a virus genome.

by OEOct 18, 2018

I loved this course a lot. It's well organized. The lectures are clear. And the practicals are highly useful. Also, the assignments are helpful.

by KSJul 20, 2021

An excellent course designed to prepare students for real challenges. Thank you Dr. Langmead, JHU and Coursera for designing such a beautiful course!

by MAOct 25, 2016

This is the best course so far! Teacher is amazing! You have to spend some time on this course, but "at the end of the day" it is worth it.

View all reviews

Frequently Asked Questions

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

More questions? Visit the Learner Help Center.

Algorithms for DNA Sequencing

About this Course

Skills you will gain