Acerca de este Curso
28,665 vistas recientes

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

Aprox. 17 horas para completar

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

Inglés (English)

Subtítulos: Inglés (English)

Habilidades que obtendrás

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

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

Aprox. 17 horas para completar

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

Inglés (English)

Subtítulos: Inglés (English)

Programa - Qué aprenderás en este curso

Semana
1
4 horas para completar

Suffix Trees

5 videos (Total 27 minutos), 5 lecturas, 1 cuestionario
5 videos
Brute Force Approach to Pattern Matching2m
Herding Patterns into Trie5m
Herding Text into Suffix Trie6m
Suffix Trees4m
5 lecturas
Trie Construction - Pseudocode10m
FAQ10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Semana
2
4 horas para completar

Burrows-Wheeler Transform and Suffix Arrays

5 videos (Total 30 minutos), 4 lecturas, 1 cuestionario
5 videos
Inverting Burrows-Wheeler Transform7m
Using BWT for Pattern Matching6m
Suffix Arrays5m
Approximate Pattern Matching6m
4 lecturas
Using BWT for Pattern Matching10m
Pattern Matching with Suffix Array10m
FAQ10m
Slides and External References10m
Semana
3
3 horas para completar

Knuth–Morris–Pratt Algorithm

5 videos (Total 35 minutos), 2 lecturas, 1 cuestionario
5 videos
Safe Shift3m
Prefix Function7m
Computing Prefix Function9m
Knuth-Morris-Pratt Algorithm5m
2 lecturas
Programming Assignment 3 lasts for two weeks2h
Slides and External References10m
1 ejercicio de práctica
Exact Pattern Matching30m
Semana
4
5 horas para completar

Constructing Suffix Arrays and Suffix Trees

11 videos (Total 76 minutos), 5 lecturas, 2 cuestionarios
11 videos
General Strategy6m
Initialization9m
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 lecturas
Counting Sort10m
Slides and External References2m
Computing the LCP Array - Additional Slides10m
Suffix Tree Construction - Pseudocode10m
Slides and External References2m
1 ejercicio de práctica
Suffix Array Construction12m
4.5
120 revisionesChevron Right

36%

comenzó una nueva carrera después de completar estos cursos

29%

consiguió un beneficio tangible en su carrera profesional gracias a este curso

Principales revisiones sobre Algorithms on Strings

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

por NROct 19th 2019

Very well put together course. Challenging but understandable. I highly recommend you stick out. If you get stuck check the forums there's lots of helpful things there. Time well spent!

Instructores

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

Acerca de Universidad de California en 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....

Acerca de 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...

Acerca de Programa especializado Estructuras de datos y algoritmos

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....
Estructuras de datos y algoritmos

Preguntas Frecuentes

  • Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

  • Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.