16. Strings
MIT 6.851 Advanced Data Structures, Spring 2012
View the complete course: http://ocw.mit.edu/6-851S12
Instructor: Erik Demaine
Strings: suffix tree, suffix array, linear-time construction for large alphabets, suffix tray, document retrieval
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 16. Strings канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-851S12
Instructor: Erik Demaine
Strings: suffix tree, suffix array, linear-time construction for large alphabets, suffix tray, document retrieval
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 16. Strings канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
Data Structures: Tries
Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search)
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
1. Persistent Data Structures
Lec 1 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Lecture 8: Hashing with Chaining
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
15. Static Trees
Google Coding Interview With A Competitive Programmer
CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
Lecture 9: Table Doubling, Karp-Rabin
1. Introduction to the Human Brain
15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
Suffix Tries
Mod-01 Lec-14 Knuth Morris Pratt Algo
17. Succinct Structures I
The Fascinating, Weird World of Quantum Matter: Karen Hallberg Public Lecture
Lec 2 | MIT 6.042J Mathematics for Computer Science, Fall 2010