@cdunn2001 Thank you. I am no bioinformatician myself, but I am trying to learn some of the standard algorithms as they may have applications elsewhere. Hope Cello turns out to be useful, though!
@bpr If you see [here](https://github.com/unicredit/cello#wavelet-tree), one can turn a string into a wavelet tree, which under the hood is represented with [indexed bit vectors](https://github.com/unicredit/cello#rrr). This means that, when turning a DNA string into this representation, it will take 2 bits per base. I am not sure if this is what you mean. Cello does not support natively reading a format which stores 4 bases per byte, but it could easily do that once it becomes generic (right now I support only strings or char sequences, possibly disk backed, but it would make sense to implement all this for any collection over some alphabet)
