Suffix arrays: min LCP skipping

I define the idea of the Longest Common Prefix (LCP) and discuss how keeping track of LCPs observed earlier in the search process enables us to skip character comparisons later in the search process.

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-...