Tries

Here I introduce this "Suffix Indexing" video playlist, which focuses on index data structures that work by organizing all the suffixes of a text. In this first video, I discuss the trie data structure and how it can be used to store collections of strings, possible associated with values. I discuss how they can be represented and queried.

These materials are also openly available on figshare. Please cite this work; this ensures that funding agencies see the impact and importance of these open learning materials.

Channel: @BenLangmead

[cellmaker]

This is good stuff. You might consider going back and labeling (in your desription) all of the tries and trees, etc., by number so that it's easier for learners to follow the sequence in order. Thanks!

[andreamansi]

Let's do it. Final exam of my uni career: advanced algorithms
Thanks for your videos 🙂