Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform

@inproceedings{Policriti2015AverageLT,
  title={Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform},
  author={Alberto Policriti and Nicola Gigante and Nicola Prezza},
  booktitle={LATA},
  year={2015}
}
The Burrows-Wheeler Transform is a text permutation that has revolutionized the fields of pattern matching and text compression, bridging the gap existing between the two. In this paper we approach the BWT-construction problem generalizing a well-known algorithm—based on backward search and dynamic strings manipulation—to work in a context-wise fashion, using automata on words. Let n, σ, and Hk be the text length, the alphabet size, and the k-th order empirical entropy of the text, respectively… CONTINUE READING
3 Citations
21 References
Similar Papers

Similar Papers

Loading similar papers…