Tries
Автор: Ben Langmead
Загружено: 2022-07-26
Просмотров: 6605
Описание:
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.
Langmead, Ben (2024). Suffix-based indexing data structures: learning materials. figshare. Collection. https://doi.org/10.6084/m9.figshare.c...
Channel: @BenLangmead
Playlist: • Suffix Indexing
Related playlist with videos on pattern matching and substring indexes: • Algorithms for DNA Sequencing
Related playlist with videos on Burrows-Wheeler indexing approaches: • Burrows-Wheeler Indexing
More materials: http://www.langmead-lab.org/teaching-...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
