Bracing against the wind  

Thursday, April 28, 2011

Dealing with FASTQ's

I posted some code for dealing with FASTq's. They're all written in C++, and each one replaces a tool that's between 3 and 50 times slower. The scoring metric they use for "anchored sequence alignment" has been improved. Also, they contain lots of "do what I mean" features, allowing the user to focus on the results, and not on the mechanics of processing sequencing data.

The essential tasks they accomplish are sequence quality filtering, adapter/primer removal, demultiplexing and paired-end joining (stitching):

They have to be compiled, but they are each "monolithic" ... and require no libraries, headers, etc. I tested fastq-join on Linux and Windows, so I know it compiles easily. The other 2 tools have only been tested on Linux.


[View/Post Comments] [Digg] [] [Stumble]

Home | Email me when this weblog updates: | View Archive

(C) 2002 Erik Aronesty/DocumentRoot.Com. Right to copy, without attribution, is given freely to anyone for any reason.

Listed on BlogShares | Bloghop: the best pretty good | Blogarama | Technorati | Blogwise