World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome.
Este curso faz parte do Programa de cursos integrados Estruturas de dados e algoritmos
Algoritmos em sequências de caracteres
oferecido por
Universidade da Califórnia, San Diego
National Research University Higher School of Economics
Informações sobre o curso
4.5
546 classificações
Habilidades que você terá
Suffix TreeSuffix ArrayKnuth–Morris–Pratt (KMP) AlgorithmAlgorithms On Strings
Programa - O que você aprenderá com este curso
Semana
14 horas para concluir
Suffix Trees
How would you search for a longest repeat in a string in LINEAR time? In 1973, Peter Weiner came up with a surprising solution that was based on suffix trees, the key data structure in pattern matching. Computer scientists were so impressed with his algorithm that they called it the Algorithm of the Year. In this lesson, we will explore some key ideas for pattern matching that will - through a series of trials and errors - bring us to suffix trees.
5 vídeos (total de (Total 27 mín.) min), 5 leituras, 1 teste
5 videos
Brute Force Approach to Pattern Matching2min
Herding Patterns into Trie5min
Herding Text into Suffix Trie6min
Suffix Trees4min
5 leituras
Trie Construction - Pseudocode10min
FAQ10min
Slides and External References10min
Available Programming Languages10min
FAQ on Programming Assignments10min
Semana
24 horas para concluir
Burrows-Wheeler Transform and Suffix Arrays
Although EXACT pattern matching with suffix trees is fast, it is not clear how to use suffix trees for APPROXIMATE pattern matching. In 1994, Michael Burrows and David Wheeler invented an ingenious algorithm for text compression that is now known as Burrows-Wheeler Transform. They knew nothing about genomics, and they could not have imagined that 15 years later their algorithm will become the workhorse of biologists searching for genomic mutations. But what text compression has to do with pattern matching??? In this lesson you will learn that the fate of an algorithm is often hard to predict – its applications may appear in a field that has nothing to do with the original plan of its inventors.
5 vídeos (total de (Total 30 mín.) min), 4 leituras, 1 teste
5 videos
Inverting Burrows-Wheeler Transform7min
Using BWT for Pattern Matching6min
Suffix Arrays5min
Approximate Pattern Matching6min
4 leituras
Using BWT for Pattern Matching10min
Pattern Matching with Suffix Array10min
FAQ10min
Slides and External References10min
Semana
33 horas para concluir
Knuth–Morris–Pratt Algorithm
Congratulations, you have now learned the key pattern matching concepts: tries, suffix trees, suffix arrays and even the Burrows-Wheeler transform! However, some of the results Pavel mentioned remain mysterious: e.g., how can we perform exact pattern matching in O(|Text|) time rather than in O(|Text|*|Pattern|) time as in the naïve brute force algorithm? How can it be that matching a 1000-nucleotide pattern against the human genome is nearly as fast as matching a 3-nucleotide pattern??? Also, even though Pavel showed how to quickly construct the suffix array given the suffix tree, he has not revealed the magic behind the fast algorithms for the suffix tree construction!In this module, Miсhael will address some algorithmic challenges that Pavel tried to hide from you :) such as the Knuth-Morris-Pratt algorithm for exact pattern matching and more efficient algorithms for suffix tree and suffix array construction.
5 vídeos (total de (Total 35 mín.) min), 2 leituras, 1 teste
5 videos
Safe Shift3min
Prefix Function7min
Computing Prefix Function9min
Knuth-Morris-Pratt Algorithm5min
2 leituras
Programming Assignment 3 lasts for two weekss
Slides and External References10min
1 exercício prático
Exact Pattern Matching30min
Semana
45 horas para concluir
Constructing Suffix Arrays and Suffix Trees
In this module we continue studying algorithmic challenges of the string algorithms. You will learn an O(n log n) algorithm for suffix array construction and a linear time algorithm for construction of suffix tree from a suffix array. You will also implement these algorithms and the Knuth-Morris-Pratt algorithm in the last Programming Assignment in this course.
11 vídeos (total de (Total 76 mín.) min), 5 leituras, 2 testes
11 videos
Suffix Array6min
General Strategy6min
Initialization9min
Sort Doubled Cyclic Shifts8min
SortDouble Implementation6min
Updating Classes8min
Full Algorithm3min
Suffix Array and Suffix Tree8min
LCP Array5min
Computing the LCP Array6min
Construct Suffix Tree from Suffix Array and LCP Array6min
5 leituras
Counting Sort10min
Slides and External References2min
Computing the LCP Array - Additional Slides10min
Suffix Tree Construction - Pseudocode10min
Slides and External References2min
1 exercício prático
Suffix Array Construction12min
50%
comecei uma nova carreira após concluir estes cursos
42%
consegui um benefício significativo de carreira com este curso
Melhores avaliações
Excelentes algoritmos, nunca había pensado lo complicado que era hacer pattern matching eficientemente en términos de tiempo de procesamiento y memoria.
great course, interesting concepts and very well delivered content from lecture videos. challenging and rewarding programming assignments.
Instrutores
Alexander S. Kulikov
Visiting ProfessorDepartment of Computer Science and Engineering
Michael Levin
LecturerComputer Science
Pavel Pevzner
ProfessorDepartment of Computer Science and Engineering
Neil Rhodes
Adjunct FacultyComputer Science and Engineering
Sobre Universidade da Califórnia, San Diego
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
Sobre National Research University Higher School of Economics
National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more.
Learn more on www.hse.ru
Sobre o Programa de cursos integrados Estruturas de dados e algoritmos
This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.
O que recebo ao me inscrever nesta Especialização?
Quando você se inscreve no curso, tem acesso a todos os cursos na Especialização e pode obter um certificado quando concluir o trabalho. Seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.
Qual é a política de reembolso?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.
O Coursera proporciona acesso universal à melhor educação do mundo fazendo parcerias com as melhores universidades e organizações para oferecer cursos on-line.
© 2019 Coursera Inc. Todos os direitos reservados.
