What is the intuition behind the Geometric Burrows-Wheeler Transform? And how can I use a GBWT with blocking factor $d$ to match a given pattern $P$ of length $|P| = m$ with
- $m \ge d$
- $m < d$
What benefits does it have over the standard BWT used with backward search?
