X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=TODO;h=7b06a07dadfa357ac55c44b26b6d5d22bea1fa84;hb=c2d5b0395937e0b44f55ee1293ab337ba6359af2;hp=4afc59af343edc2678fa86d7c522638962b228b9;hpb=1fd93f3d6e283e5b69a187b9ece80e6ea554390a;p=fastq-tools.git

diff --git a/TODO b/TODO
index 4afc59a..7b06a07 100644
--- a/TODO
+++ b/TODO
@@ -1,35 +1,16 @@
 
-general
-=======
+Rename hash.h/c to hash_table.h/c.
 
-Man pages!
+Seperate murmurhash into it's own file: hash.h/hash.c.
 
+Document fastq-sort.
 
-I would like to encorporate some domain-specific compression algorithm. Options
-I know of:
-  * G-SQZ (http://www.tgen.org/research/gsqueez.cfm) : not open source (i.e. not an option)
-  * fqzcomp (http://seqanswers.com/forums/archive/index.php/t-6349.html)
-  * DSRC (http://bioinformatics.oxfordjournals.org/cgi/content/short/27/6/860?rss=1) :
-    Not yet available?
-  * Invent my own.
+More comparison functions for fastq-sort.
 
+Link against quip so we can run these tools on quip/fastq/bam/sam with one
+interface.
 
-
-
-
-
-program specific
-================
-
-
-fastq-grep
-----------
-
-
-
-fastq-kmers
------------
-
+Make a website for fastq-tools.
 
 
 fastq-match
@@ -43,9 +24,3 @@ might look to Phil Green's cross_match implementation for ideas.
 An option to return the sequences that match past a certain threshold would be
 useful.
 
-
-
-fastq-uniq
-----------
-
-