purplesyringa.moe

Suffix BWT vs cyclic shift BWT, and fast computation | purplesyringa's blog

Intended audience: data compression geeks. The Burrows-Wheeler transform takes a string as an input and rearranges its characters, grouping them by context. It is invertible with 𝒪 ( 1 ) additional input, and together t…

If the page stays blank, open it in a new tab. Your Weird rating still works from the top bar.

Open source