Suffix BWT vs cyclic shift BWT, and fast computation
Summary
This article analyzes cyclic shift BWT vs suffix BWT, detailing how each variant works, their decoding/encoding trade-offs, and practical implementation strategies. It covers approach options like SA-IS and doubling the string, the Duval algorithm for smallest cyclic shift, and provides references and code pointers to libsais and related tools.