String Processing and Pattern Matching Algorithms

Обучение бесплатное
Сертификация платная
2 часа курса
О курсе

The world and internet are full of textual information. We search for information using textual queries and read websites, books and e-mails.

These are all strings from a computer science point of view. To make sense of all this 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.

In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn about:

  • suffix trees;
  • suffix arrays;
  • how other brilliant algorithmic ideas help doctors to find differences between genomes;
  • power lightning-fast Internet searches.
String Processing and Pattern Matching Algorithms
Learn about pattern matching and string processing algorithms and how they apply to interesting applications.
Что Вы изучите?
  • Key ideas for pattern matching and suffix trees
  • Suffix arrays
  • Burrows-Wheeler Transform for compression
  • Applications of string algorithms in bioinformatics
Pavel Pevzner
Pavel Pevzner
Ronald R. Taylor Professor of Computer Science The University of California, San Diego
Pavel Pevzner is Ronald R. Taylor Professor of Computer Science at the University of California, San Diego. He holds a Ph.D. from Moscow Institute of Physics and Technology, Russia. He is a Howard Hughes Medical Institute Professor (2006-present), an Association for Computing Machinery Fellow (2010), and an International Society for Computational Biology Fellow (2012). In addition to Bioinformatics Algorithms: An Active Learning Approach, he has authored the textbooks Computational Molecular Biology: An Algorithmic Approach (2000) and An Introduction to Bioinformatics Algorithms (2004) (jointly with Neil Jones).
Michael Levin
Michael Levin
Chief Data Scientist Yandex.Market
Michael serves as chief data scientist at Yandex.Market (Yandex is the leading Internet company in Russia, and Yandex.Market is the leading service for price comparison online shopping in Russia). He has a degree in mathematics from Moscow State University. During his studies Michael was a silver and bronze medalist of ACM ICPC World Finals as a member of Moscow State University team.
Эта платформа предоставляет все курсы бесплатно. Авторами выступают топовые университеты и корпорации, которые стараются удерживать стандарты качества. За несоблюдение дедлайнов, невыполнение домашнего задания студенты теряют баллы. Как и в других платформах, лекционные видео чередуются с практическими заданиями. Обучение проводится на английском, китайском, испанском, французском и хинди.
String Processing and Pattern Matching Algorithms