开始时间: 04/22/2022 持续时间: Unknown
|
所在平台: CourseraArchive 课程类别: 计算机科学 大学或机构: CourseraNew |
课程主页: https://www.coursera.org/archive/algorithms-on-strings
课程评论：没有评论
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. Do you have technical problems? Write to us: coursera@hse.ru
How would you search for a 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, we will explore some key ideas for pattern matching that will - through a series of trials and errors - bring us to suffix trees.
World and internet is full of textual information. We search for information using textual queries,
