TrueschoTruescho
All Courses
Algorithms on Strings
Coursera
Course
Unknown

Algorithms on Strings

University of California San Diego

This course covers key string algorithms for efficient text processing, including pattern matching with tries, suffix trees, suffix arrays, and Burrows-Wheeler transform.

Unknown4 weeksEnglish97,536 enrolled

About this Course

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. In this online course you will learn key pattern matching concepts: tries, suffix trees, suffix arrays and even the Burrows-Wheeler transform

What You'll Learn

  • Understand core concepts of pattern matching in strings
  • Use tries and suffix arrays for text analysis
  • Apply Burrows-Wheeler transform in text processing
  • Analyze efficiency of string search algorithms

Prerequisites

  • Basic familiarity with algorithms concepts and terminology
  • Willingness to practice through applied exercises or case studies

Instructors

N

Neil Rhodes

Adjunct Faculty

M

Michael Levin

Visiting Scholar

M

Michael Levin

Lecturer

P

Pavel Pevzner

Professor

Topics

Algorithms
Computer Science
Health Informatics
Health
Computational Thinking
Text Mining
Theoretical Computer Science
Data Structures
Bioinformatics

Course Info

PlatformCoursera
LevelUnknown
PacingUnknown
PriceFree

Skills

خوارزميات
علوم الحاسب
المعالجة النصية
هياكل البيانات
التفكير الحاسوبي
تنقيب البيانات
علوم الحاسوب النظرية
معلومات الصحة
Bioinformatics

Start Learning Now