Suffix arrays: the suffix tree is hiding

We discuss l-intervals of the suffix array and how they correspond to nodes of the suffix tree. We further see how to traverse the suffix array's l-interval structure in a way that mimics traversing the suffix tree.

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.

Langmead, Ben (2024). Suffix-based indexing data structures: learning materials. figshare. Collection. https://doi.org/10.6084/m9.figshare.c.7205547

Channel: @BenLangmead
Playlist: https://youtube.com/playlist?list=PL2mpR0RYFQsDFNyRsTNcWkFTHTkxWREeb
Related playlist with videos on pattern matching and substring indexes: https://youtube.com/playlist?list=PL2mpR0RYFQsBiCWVJSvVAO3OJ2t7DzoHA
Related playlist with videos on Burrows-Wheeler indexing approaches: https://www.youtube.com/playlist?list=PL2mpR0RYFQsADmYpW2YWBrXJZ_6EL_3nu
More materials: http://www.langmead-lab.org/teaching-materials/

Видео Suffix arrays: the suffix tree is hiding канала Ben Langmead