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
Brute Force Approach to Pattern Matching
Loading...
Destrezas que aprenderás
Suffix Tree, Suffix Array, Knuth–Morris–Pratt (KMP) Algorithm, Algorithms On Strings
Revisiones
PG
Nov 19, 2017
great course, interesting concepts and very well delivered content from lecture videos. challenging and rewarding programming assignments.
KP
Jun 24, 2018
Learned a lot in the class. It was really excellent. But many a times we need to hear twice to understand some of the concepts clearly.
De la lección
Suffix Trees
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.
Impartido por:
Alexander S. Kulikov
Visiting Professor
Michael Levin
Lecturer
Pavel Pevzner
Professor
Neil Rhodes
Adjunct Faculty
Explora nuestro catálogo
Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.
Coursera brinda acceso universal a la mejor educación del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en línea.
© 2019 Coursera Inc. Todos los derechos reservados.
