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.
Этот курс входит в специализацию ''Специализация Структуры и алгоритмы данных'
от партнера
Калифорнийский университет в Сан-Диего
НИУ ВШЭ
Специализация Структуры и алгоритмы данныхКалифорнийский университет в Сан-ДиегоОб этом курсе
Недавно просмотрено: 19,469
Карьерные результаты учащихся
36%
начал новую карьеру, пройдя эти курсы
29%
получил значимые преимущества в карьере благодаря этому курсу
Сертификат, ссылками на который можно делиться с другими людьми
Получите сертификат по завершении
100% онлайн
Начните сейчас и учитесь по собственному графику.
Курс 4 из 6 в программе
Гибкие сроки
Назначьте сроки сдачи в соответствии со своим графиком.
Средний уровень
Прибл. 17 часов на выполнение
Английский
Субтитры: Арабский, Французский, Португальский (Европа), Китайский (упрощенное письмо), Итальянский, Вьетнамский, Корейский, Немецкий, Русский, Турецкий, Английский, Испанский
Приобретаемые навыки
Suffix TreeSuffix ArrayKnuth–Morris–Pratt (KMP) AlgorithmAlgorithms On Strings
Карьерные результаты учащихся
36%
начал новую карьеру, пройдя эти курсы
29%
получил значимые преимущества в карьере благодаря этому курсу
Сертификат, ссылками на который можно делиться с другими людьми
Получите сертификат по завершении
100% онлайн
Начните сейчас и учитесь по собственному графику.
Курс 4 из 6 в программе
Гибкие сроки
Назначьте сроки сдачи в соответствии со своим графиком.
Средний уровень
Прибл. 17 часов на выполнение
Английский
Субтитры: Арабский, Французский, Португальский (Европа), Китайский (упрощенное письмо), Итальянский, Вьетнамский, Корейский, Немецкий, Русский, Турецкий, Английский, Испанский
от партнера
Калифорнийский университет в Сан-Диего
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.
НИУ ВШЭ
HSE University 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.
Программа курса: что вы изучите
4 ч. на завершение
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.
4 ч. на завершение
5 видео ((всего 27 мин.)), 6 материалов для самостоятельного изучения, 1 тест
4 ч. на завершение
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.
4 ч. на завершение
5 видео ((всего 30 мин.)), 4 материалов для самостоятельного изучения, 1 тест
3 ч. на завершение
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.
3 ч. на завершение
5 видео ((всего 35 мин.)), 2 материалов для самостоятельного изучения, 1 тест
5 ч. на завершение
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.
5 ч. на завершение
11 видео ((всего 76 мин.)), 5 материалов для самостоятельного изучения, 2 тестов
Рецензии
Лучшие отзывы о курсе СТРОКОВЫЕ АЛГОРИТМЫ
от партнера CS7 июля 2019 г.
Very good course. String algorithms are very important in day today life and one should really know how to solve command problems related to it. This course have described everything so well.
от партнера PA12 мая 2020 г.
course content was great but i personally feels some difficulties in the implementation part so the course is meant to be more implementation oriented . thank you for the wondorful course
от партнера NR18 окт. 2019 г.
Very well put together course. Challenging but understandable. I highly recommend you stick out. If you get stuck check the forums there's lots of helpful things there. Time well spent!
от партнера JM13 нояб. 2016 г.
It would be nice if you could deliver the problem's solutions after the course ended. I ran out of ideas for the BetterBWMatching problem and i couldn't overcome the time issues.
Специализация Структуры и алгоритмы данных: общие сведения
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.
Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оформив подписку на специализацию?
Is financial aid available?
Получу ли я зачеты в университете за прохождение курса?
Остались вопросы? Посетите Центр поддержки учащихся.
