Free Online Course in String Processing and Pattern Matching Algorithms from edx
Learn about pattern matching and string processing algorithms and how they apply to interesting applications.
- English
- With Certificate
Tutor Name
edXAbout the Course
Edx is offering a free online course in String Processing and Pattern Matching Algorithms. In this course, you will learn about pattern matching and string processing algorithms and how they apply to interesting applications.
About this course:-
- The world and internet are full of textual information. People 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.
What You'll learn:-
- Key ideas for pattern matching and suffix trees.
- Suffix arrays.
- Burrows-Wheeler Transform for compression.
- Applications of string algorithms in bioinformatics.
Syllabus:-
- Weeks 1 and 2: Suffix Trees
- How would you search for the 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, you will explore some key ideas for pattern matching that will - through a series of trials and errors - bring you to suffix trees.
- Week 3 and 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 would become the workhorse of biologists searching for genomic mutations.
- 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.
Conditions:-
- You should be good at English.
- The course is free but if you want to Pursue a Verified Certificate to highlight the knowledge and skills you gain, you should pay $150.00.
- The course needs 4 weeks with 8–10 hours of work per week.
- Prerequisites:
- Basic knowledge of at least one programming language.
- Successful completion of the Algorithmic Designs and Techniques and Data Structures Fundamentals courses.
See more scholarships available on For9a
See more available internships on For9a
Taught by
Founded in 2012 by Harvard University and MIT, edX is a premier online learning platform and MOOC provider offering high-quality courses, professional certificates, and degrees from top-tier universities and institutions worldwide, with a mission to increase access to education. The platform enables over 86 million learners to acquire in-demand skills in fields like computer science, AI, and business, allowing them to audit courses for free or pay for verified certificates to boost their professional careers.
Read more.