39:58

BWT for repetitive texts, part 3: Toehold lemma setup

28:31

Suffix arrays: the suffix tree is hiding

42:47

BWT for repetitive texts, part 2: Run-length FM index

09:24

Suffix arrays: building

21:17

Suffix arrays: maximum skipping

10:05

Suffix arrays: min LCP skipping

16:37

Suffix arrays: basic queries

12:33

Suffix arrays: definition & size

24:56

Matching statistics on the suffix tree

16:13

Suffix trees: matching statistics

23:57

Suffix trees: suffix links

16:13

Suffix trees: basic queries

12:50

Suffix trees: building

28:16

Suffix trees: definition & size

17:00

Suffix tries: size

26:27

Suffix tries: introduction

27:51

Tries

29:26

BWT for repetitive texts, part 1: Runs

43:45

Wheeler graphs, part 5: Data structures

16:15

Wheeler graphs, part 4: Consecutivity

38:53

Wheeler graphs, part 3: Definition

21:29

Wheeler graphs, part 2: BW order for graphs

24:57

Wheeler graphs, part 1: substrings to paths

29:51

FM Index, part 2: efficient matching

22:18

FM Index, part 1: efficient reversal

19:48

Wavelet trees, part 2

28:23

Wavelet trees, part 1

34:30

Clark's select

20:04

Burrows-Wheeler Transform, part 2

29:16

Burrows-Wheeler Transform, part 1

25:03

High order empirical entropy

18:50

CountMin sketch, part 3

34:40

CountMin sketch, part 2: proving error bound

26:48

CountMin sketch, part 1

15:23

Markov's inequality

37:33

Similarity & MinHash

34:44

Cardinality part 2: proof & kth minimum value

29:34

Cardinality part 1: the hat problem

43:40

Universal hashing with a prime field

22:43

Universal hashing part 1: motivation

32:31

Coupon collector and more Bloom filters

24:52

Bloom filters, part 2

28:45

Bloom filters, part 1

12:43

Hashes & randomness

21:56

Hash tables & probability, part 2

43:19

Hash tables & probability, part 1

24:14

Randomness & independence

59:26

Entropy & coding

22:02

Intro: Indexing

22:56

Jacobson's rank

37:06

Bitvectors and rank/select

26:01

Dashing: fast & accurate genomic distances with HyperLogLog

10:33

ADS1: Meet the family: global and local alignment

12:10

ADS1: Using dynamic programming for edit distance

12:10

ADS1: Using dynamic programming for edit distance

09:35

ADS1: Genome indexes used in research

09:26

ADS1: Variations on k-mer indexes

12:32

ADS1: Solving the edit distance problem

09:37

ADS1: The future is long?

08:34

ADS1: Assemblers in practice