The simulator visualizes how an input sequence over a small alphabet is recursively split into a binary tree of bitvectors, and how a single access, rank, or select query travels down or up that tree using rank and select operations at each level to arrive at its answer.
Enter or generate a sequence over a chosen small alphabet, watch the wavelet tree build level by level as the alphabet range is halved at each node, then pick an access, rank, or select query and step through the highlighted path the query takes through the tree, with each level's bitvector and its rank or select computation shown explicitly.
Controls include sequence input or random generation, alphabet size selection, step-by-step tree construction playback, query type selection among access, rank, and select, query parameter inputs, and a path-highlighting playback control that steps through the bitvector operations level by level.
Did you know that the FM-index used by widely deployed genome aligners like BWA and Bowtie stores the entire Burrows-Wheeler-transformed genome as a wavelet tree, letting them count how many times a DNA pattern occurs in a multi-gigabase genome using only a few dozen rank operations, without ever decompressing the sequence?
The simulator visualizes how an input sequence over a small alphabet is recursively split into a binary tree of bitvectors, and how a single access, rank, or select query travels down or up that tree using rank and select operations at each level to arrive at its answer.
The simulator visualizes how an input sequence over a small alphabet is recursively split into a binary tree of bitvectors, and how a single access, rank, or select query travels down or up that tree using rank and select operations at each level to arrive at its answer.
Enter or generate a sequence over a chosen small alphabet, watch the wavelet tree build level by level as the alphabet range is halved at each node, then pick an access, rank, or select query and step through the highlighted path the query takes through the tree, with each level's bitvector and its rank or select computation shown explicitly.
Did you know that the FM-index used by widely deployed genome aligners like BWA and Bowtie stores the entire Burrows-Wheeler-transformed genome as a wavelet tree, letting them count how many times a DNA pattern occurs in a multi-gigabase genome using only a few dozen rank operations, without ever decompressing the sequence?