About this Course
27,345 recent views

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Approx. 17 hours to complete

Suggested: 4 weeks of study, 4-8 hours/week...

English

Subtitles: English

Skills you will gain

Suffix TreeSuffix ArrayKnuth–Morris–Pratt (KMP) AlgorithmAlgorithms On Strings

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Approx. 17 hours to complete

Suggested: 4 weeks of study, 4-8 hours/week...

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
4 hours to complete

Suffix Trees

5 videos (Total 27 min), 5 readings, 1 quiz
5 readings
Trie Construction - Pseudocode10m
FAQ10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Week
2
4 hours to complete

Burrows-Wheeler Transform and Suffix Arrays

5 videos (Total 30 min), 4 readings, 1 quiz
5 videos
Suffix Arrays5m
Approximate Pattern Matching6m
4 readings
Using BWT for Pattern Matching10m
Pattern Matching with Suffix Array10m
FAQ10m
Slides and External References10m
Week
3
3 hours to complete

Knuth–Morris–Pratt Algorithm

5 videos (Total 35 min), 2 readings, 1 quiz
5 videos
Computing Prefix Function9m
Knuth-Morris-Pratt Algorithm5m
2 readings
Programming Assignment 3 lasts for two weeks2h
Slides and External References10m
1 practice exercise
Exact Pattern Matching30m
Week
4
5 hours to complete

Constructing Suffix Arrays and Suffix Trees

11 videos (Total 76 min), 5 readings, 2 quizzes
11 videos
Sort Doubled Cyclic Shifts8m
SortDouble Implementation6m
Updating Classes8m
Full Algorithm3m
Suffix Array and Suffix Tree8m
LCP Array5m
Computing the LCP Array6m
Construct Suffix Tree from Suffix Array and LCP Array6m
5 readings
Counting Sort10m
Slides and External References2m
Computing the LCP Array - Additional Slides10m
Suffix Tree Construction - Pseudocode10m
Slides and External References2m
1 practice exercise
Suffix Array Construction12m
4.5
110 ReviewsChevron Right

40%

started a new career after completing these courses

31%

got a tangible career benefit from this course

Top reviews from Algorithms on Strings

By CSJul 8th 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.

By HCMay 7th 2018

Excelentes algoritmos, nunca había pensado lo complicado que era hacer pattern matching eficientemente en términos de tiempo de procesamiento y memoria.

Instructors

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Pavel Pevzner

Professor
Department of Computer Science and Engineering
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

About University of California 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....

About 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...

About the Data Structures and Algorithms Specialization

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....
Data Structures and Algorithms

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

More questions? Visit the Learner Help Center.