Русский
English
What will you learn?
Key ideas for pattern matching and suffix trees
Suffix arrays
Burrows-Wheeler Transform for compression
Applications of string algorithms in bioinformatics
About the course
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.
Program
String Processing and Pattern Matching Algorithms
Learn about pattern matching and string processing algorithms and how they apply to interesting applications.
Lecturers
Pavel Pevzner
Ronald R. Taylor Professor of Computer Science The University of California, San Diego
Michael Levin
Chief Data Scientist Yandex.Market
Platform
All the courses on this platform are free of charge. The authors are top universities and corporations that seek to maintain high quality standards. If you do not meet a deadline for assignments, you lose points. Like on other platforms, the videos in which the theory is explained are followed by practical assignments. Courses are available in English, Chinese, Spanish, French and Hindi.