The exact and approximate string matching with Burrows-Wheeler transform
Artur Kazjer, Rafał Pokrzywa · 2013
This paper describes how the problem of exact and approximate string matching can be resolved using Burrows-Wheeler Transform. The paper considers how compressed full-text indexes work and allow string matching algorithms to operate in a limited space. Two main data structures presented in the text are Wavelet Tree and Bi-directional Burrows Wheeler Transform.