Yes, there is a TODO: Get rid of the "cheap watches" spam sent to this list. In fact the signal/noise ratio makes we want to unsubscribe.
Other than that, I'd like to see someone reverse-engineer one of the major sequence index formats and provide a Haskell interface, so that we can design our own functional alignment algorithms instead of building shell scripts around bowtie or bwa. By reverse-engineer I mean look at the source code. It's all there, but poorly documented. I understand too little C/C++ to make sense of how precisely these index structures are stored. But if one could write a Data.Binary instance, that'd be awesome. Meanwhile I implemented a Lempel-Ziv together with full-text search on the compressed data (not my idea). This is possible if one uses one trie for the entire text. However, full-text search only succeeds if the match overlaps a block boundary. That should be fine for sufficiently long queries. --Olaf
