2 Rename hash.h/c to hash_table.h/c.
4 Seperate murmurhash into it's own file: hash.h/hash.c.
8 More comparison functions for fastq-sort.
10 Link against quip so we can run these tools on quip/fastq/bam/sam with one
13 Make a website for fastq-tools.
19 Specifying the score matrix, rather than using a hardcoded.
21 The implementation of the Smith-Waterman algorithm could be more efficient. We
22 might look to Phil Green's cross_match implementation for ideas.
24 An option to return the sequences that match past a certain threshold would be