# DESA


## References

- F. Claude, G. Navarro, and A. Ordóñez, "The wavelet matrix: An efficient wavelet tree for large alphabets," _Information Systems_, vol. 47, pp. 15-32, 2015.
- M. Salson, T. Lecroq, M. Léonard, and L. Mouchard, "A Four-Stage Algorithm for Updating a Burrows-Wheeler Transform," _Theoretical Computer Science_, vol. 410, no. 43, pp. 4350-4359, 2009.
- M. Salson, T. Lecroq, M. Léonard, and L. Mouchard, "Dynamic Extended Suffix Array," _Journal of Discrete Algorithms_, vol. 8, no. 2, pp. 241-257, 2010.


## License

Copyright (c) 2015, Chi-En Wu.

Distributed under [The BSD 3-Clause License](http://opensource.org/licenses/BSD-3-Clause).

# DESA


## References

- F. Claude, G. Navarro, and A. Ordóñez, "The wavelet matrix: An efficient wavelet tree for large alphabets," _Information Systems_, vol. 47, pp. 15-32, 2015.
- W. Gerlach, "Dynamic FM-Index for a collection of texts with application to space-efficient construction of the compressed suffix array", Master's thesis, Universität Bielefeld, Germany, 2007.
- M. Salson, T. Lecroq, M. Léonard, and L. Mouchard, "A Four-Stage Algorithm for Updating a Burrows-Wheeler Transform," _Theoretical Computer Science_, vol. 410, no. 43, pp. 4350-4359, 2009.
- M. Salson, T. Lecroq, M. Léonard, and L. Mouchard, "Dynamic Extended Suffix Array," _Journal of Discrete Algorithms_, vol. 8, no. 2, pp. 241-257, 2010.


## License

Copyright (c) 2015, Chi-En Wu.

Distributed under [The BSD 3-Clause License](http://opensource.org/licenses/BSD-3-Clause).

Add reference for our bit vector implementation
Add reference for our bit vector implementation
