10: Huffman-Shaped Wavelet Tree, Succinct Data Structures, Übung

0:00:00 Starten
0:00:21 Wavelet Tree Example: Calculate Rank
0:09:48 Huffman-shaped Wavelet Tree
0:12:42 Practical Performance of FM-Index
0:14:54 Succinct Data Structures
0:17:09 Succinct representation of trees
0:19:34 Child operation in detail
0:22:09 Succinct representation of trees (2)
0:29:34 LOUDS-level order unary degree sequence
0:44:15 Anfang der Übung
0:44:30 Today topics
0:44:59 Select in constant time: Step 1
0:47:49 Select in constant time: Step 2
0:49:33 Select in constant time: Step 3
0:56:54 Select in constant time: Query
1:01:17 Lempel-Ziv: Overview
1:02:06 Sliding Window Lempel-Ziv 77
1:08:01 Lempel-Ziv 78
1:16:08 Sliding Window Lempel-Ziv 77

Dozenten:
Dr. rer. nat. Simon Gog, M. Sc. Yaroslav Akhremtsev | Karlsruher Institut für Technologie (KIT), Institut für Theoretische Informatik

Vorlesungsaufzeichnung: KIT | WEBCAST