A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
We present a four-stage algorithm that updates the Burrows-Wheeler Transform of a text T , when this text is modified. The Burrows-Wheeler Transform is used by many text compression applications and some self-index data structures. It operates by reordering the letters of a text T to obtain a new text bwt(T ) which can be better compressed. Even if recent advances are offering this structure new applications, a major bottleneck still exists: bwt(T ) has to be entirely reconstructed from scratchdoi:10.1016/j.tcs.2009.07.016 fatcat:7epl7gq3lzatnf75hc7jb47qai