LibStatGen: FASTQ

Validation Criteria

Sequence Identifier Line

Validation Criteria	Error Message
Line is at least 2 characters long ('@' and at least 1 for the sequence identifier)	ERROR on Line <current line #>:
Line starts with an '@'	ERROR on Line <current line #>:
Line does not contain a space between the '@' and the first sequence identifier (which must be at least 1 character).	ERROR on Line <current line #>:
Every entry in the file should have a unique identifier.	ERROR on Line <current line #>: Repeated Sequence Identifier: <identifier> at Lines <previous line #> <current line #>

Raw Sequence Line

Validation Criteria	Error Message
A base sequence should have non-zero length.	ERROR on Line <current line #>:
All characters in the base sequence must be in the allowable set specified via configuration. Base Only: A C T G N a c t g n Color Space Only: 0 1 2 3 .(period) Base or Color Space: A C T G N a c t g n 0 1 2 3 .(period)	ERROR on Line <current line #>:
Reads should be of a configurable minimum length since many mappers will get into trouble with very short reads. If the raw sequence spans lines, the sum of the lengths of all lines are validated, not each individual line.	ERROR on Line <current line #>:
Each Line of a Raw Sequence should have at least 1 character (not be blank).	ERROR on Line <current line #>:

Plus Line

Validation Criteria	Error Message
Must exist for every sequence.	ERROR on Line <current line #>:
If the optional sequence identifier is specified, it must equal the one on the Sequence Identifier Line.	ERROR on Line <current line #>:

Quality String Line

Validation Criteria	Error Message
A quality string should be present for every base sequence.	ERROR on Line <current line #>:
Paired quality and base sequences should be of the same length.	ERROR on Line <current line #>:
Valid quality values should all have ASCII codes > 32.	ERROR on Line <current line #>:

Additional Features

• Base composition are reported and tracked by position.
• Consumes gzipped and uncompressed text files transparently (see libcsg/InputFile.h).

Additional Wishlist - Not Implemented

• To reduce memory usage, implement a two-pass algorithm that stores only a key for each sequence name (rather than complete sequence names) in memory (suggest a pair of options -1 -> one pass, high memory use, -2 -> two pass lower memory use, default is -1).

Assumptions

• The Sequence Identifier is separated by an optional comment by a " ".
• No validation is required on the optional comment field of the Sequence Identifier Line.
• The Sequence Identifier and the '+' Lines cannot wrap lines. The are each completely contained on one line.
• Raw Sequences and Quality Strings may wrap lines
• All lines are part of the Raw Sequence Line until a line that starts with a '+' is discovered.
• All lines are considered part of the quality string until at least the length of the associated raw sequence is hit (or the end of the file is reached). This is due to the fact that '@' is a valid quality character, so does not necessarily indicate the start of a Sequence Identifier Line.

How to Use the fastQValidator Executable

Required Parameters:

       -f  :  FastQ filename with path to be prorcessed.

Optional Parameters:

       -l  :  Minimum allowed read length (Defaults to 10).
       -e  :  Maximum number of errors to display before suppressing them(Defaults to 20).
       -b  :  Raw sequence type:  B - ACTGN only (Default)
                                  C - 0123. only
                                 BC - ACTGN or 0123.

Testing only Parameters:

       -t  :  If "ReadOnly" is specified, the fastq will be read but not processed.  This may be used for determining read time.

Usage:

       ./fastQValidator -f <fileName> -l <minReadLen> -e <maxReprotedErrors> -b <rawSeqType>

Examples:

       ../fastQValidator -f testFile.txt
       ../fastQValidator -f testFile.txt -l 10 -b BC -e 100
       ./fastQValidator -f test/testFile.txt -l 10 -b BC -e 100
       time ./fastQValidator -f test/testFile.txt -t ReadOnly

FastQ Validator Output

Coming Soon