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.
Este curso faz parte do Programa de cursos integrados Análise de Dados GenômicosAnálise Genômica
oferecido por
Programa de cursos integrados Análise de Dados GenômicosAnálise GenômicaUniversidade Johns HopkinsInformações sobre o curso
39,992 visualizações recentes
Resultados de carreira do aprendiz
43%
comecei uma nova carreira após concluir estes cursos
33%
consegui um benefício significativo de carreira com este curso
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Aprox. 12 horas para completar
Inglês
Legendas: Árabe, Francês, Portuguese (European), Chinês (simplificado), Italiano, Vietnamita, Coreano, Alemão, Russo, Turco, Inglês, Espanhol
Habilidades que você terá
Bioinformatics AlgorithmsAlgorithmsPython ProgrammingAlgorithms On Strings
Resultados de carreira do aprendiz
43%
comecei uma nova carreira após concluir estes cursos
33%
consegui um benefício significativo de carreira com este curso
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Aprox. 12 horas para completar
Inglês
Legendas: Árabe, Francês, Portuguese (European), Chinês (simplificado), Italiano, Vietnamita, Coreano, Alemão, Russo, Turco, Inglês, Espanhol
oferecido por
Universidade Johns Hopkins
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.
Programa - O que você aprenderá com este curso
4 horas para concluir
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 horas para concluir
19 vídeos (Total 112 mín.), 7 leituras, 2 testes
19 videos
Lecture: Why study this?4min
Lecture: DNA sequencing past and present3min
Lecture: Genomes as strings, reads as substrings5min
Lecture: String definitions and Python examples3min
Practical: String basics 7min
Practical: Manipulating DNA strings 7min
Practical: Downloading and parsing a genome 6min
Lecture: How DNA gets copied3min
Optional lecture: How second-generation sequencers work 7min
Optional lecture: Sequencing errors and base qualities 6min
Lecture: Sequencing reads in FASTQ format4min
Practical: Working with sequencing reads 11min
Practical: Analyzing reads by position 6min
Lecture: Sequencers give pieces to genomic puzzles5min
Lecture: Read alignment and why it's hard3min
Lecture: Naive exact matching10min
Practical: Matching artificial reads 6min
Practical: Matching real reads 7min
7 leituras
Welcome to Algorithms for DNA Sequencing10min
Pre Course Survey10min
Syllabus10min
Setting up Python (and Jupyter)10min
Getting slides and notebooks10min
Using data files with Python programs10min
Programming Homework 1 Instructions (Read First)10min
2 exercícios práticos
Module 130min
Programming Homework 130min
3 horas para concluir
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 horas para concluir
15 vídeos (Total 114 mín.), 1 leitura, 2 testes
15 videos
Week 2 Introduction 1min
Lecture: Boyer-Moore basics8min
Lecture: Boyer-Moore: putting it all together6min
Lecture: Diversion: Repetitive elements5min
Practical: Implementing Boyer-Moore 10min
Lecture: Preprocessing7min
Lecture: Indexing and the k-mer index10min
Lecture: Ordered structures for indexing8min
Lecture: Hash tables for indexing7min
Practical: Implementing a k-mer index 7min
Lecture: Variations on k-mer indexes9min
Lecture: Genome indexes used in research9min
Lecture: Approximate matching, Hamming and edit distance6min
Lecture: Pigeonhole principle6min
Practical: Implementing the pigeonhole principle 9min
1 leituras
Programming Homework 2 Instructions (Read First)10min
2 exercícios práticos
Module 230min
Programming Homework 230min
3 horas para concluir
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 horas para concluir
13 vídeos (Total 92 mín.), 1 leitura, 2 testes
13 videos
Lecture: Solving the edit distance problem12min
Lecture: Using dynamic programming for edit distance12min
Practical: Implementing dynamic programming for edit distance 6min
Lecture: A new solution to approximate matching9min
Lecture: Meet the family: global and local alignment10min
Practical: Implementing global alignment 8min
Lecture: Read alignment in the field4min
Lecture: Assembly: working from scratch2min
Lecture: First and second laws of assembly8min
Lecture: Overlap graphs8min
Practical: Overlaps between pairs of reads 4min
Practical: Finding and representing all overlaps 3min
1 leituras
Programming Homework 3 Instructions (Read First)10min
2 exercícios práticos
Module 330min
Programming Homework 330min
3 horas para concluir
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 horas para concluir
13 vídeos (Total 83 mín.), 1 leitura, 2 testes
13 videos
Lecture: The shortest common superstring problem8min
Practical: Implementing shortest common superstring 4min
Lecture: Greedy shortest common superstring7min
Practical: Implementing greedy shortest common superstring 7min
Lecture: Third law of assembly: repeats are bad5min
Lecture: De Bruijn graphs and Eulerian walks8min
Practical: Building a De Bruijn graph 4min
Lecture: When Eulerian walks go wrong9min
Lecture: Assemblers in practice8min
Lecture: The future is long?9min
Lecture: Computer science and life science5min
Lecture: Thank yous 43s
1 leituras
Post Course Survey10min
2 exercícios práticos
Programming Homework 430min
Module 430min
Avaliações
Principais avaliações do ALGORITMOS APLICADO AO SEQUENCIAMENTO DE DNA
por VK7 de Ago de 2017
This course provided me a very quick overview of all the core concepts pertaining to DNA sequencing. It is very well organized, crystal clear demonstration of concepts and I really enjoyed the course.
por KP18 de Mai de 2020
Very good course this is. Just a little advice, please make the quiz questions more clear and more specific because one shouldn't waste time to understand a question which is very easy to implement.
por MY9 de Out de 2020
One of the most useful courses I have joined. Many thanks to the instructors for these quality lectures and for the time spent to deliver the information as easily as possible!
por JD30 de Dez de 2020
Highly eloquent instructors that make intricate concepts accessible and fun to learn. Would definitely help if you have some programming or bioinformatics background beforehand.
Sobre Programa de cursos integrados Análise de Dados GenômicosAnálise Genômica
With genomics sparks a revolution in medical discoveries, it becomes imperative to be able to better understand the genome, and be able to leverage the data and information from genomic datasets. Genomic Data Science is the field that applies statistics and data science to the genome.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
O que recebo ao me inscrever nesta Especialização?
Is financial aid available?
Ganharei créditos universitários por concluir o curso?
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.
