Problems Base course RU

Built on

suffix structures

Articles

STR Algorithm The Burrows–Wheeler transform A permutation that compresses a text and serves as an index to it: backward search, LF, and read alignment. O(m) to count a pattern, O(m + k·s) for k positions 2 problems

Problems

A genome's suffixes by digits Counting in the transform Where the reads land

Often together

string matching 1 compression 1 bioinformatics 1 search engines 1 in production 1