FASTQSim: platform-independent data characterization and in silico read generation for NGS datasets
© Shcherbina; licensee BioMed Central Ltd. 2014
Received: 7 April 2014
Accepted: 4 August 2014
Published: 15 August 2014
High-throughput next generation sequencing technologies have enabled rapid characterization of clinical and environmental samples. Consequently, the largest bottleneck to actionable data has become sample processing and bioinformatics analysis, creating a need for accurate and rapid algorithms to process genetic data. Perfectly characterized in silico datasets are a useful tool for evaluating the performance of such algorithms. Background contaminating organisms are observed in sequenced mixtures of organisms. In silico samples provide exact truth. To create the best value for evaluating algorithms, in silico data should mimic actual sequencer data as closely as possible.
FASTQSim is a tool that provides the dual functionality of NGS dataset characterization and metagenomic data generation. FASTQSim is sequencing platform-independent, and computes distributions of read length, quality scores, indel rates, single point mutation rates, indel size, and similar statistics for any sequencing platform. To create training or testing datasets, FASTQSim has the ability to convert target sequences into in silico reads with specific error profiles obtained in the characterization step.
FASTQSim enables users to assess the quality of NGS datasets. The tool provides information about read length, read quality, repetitive and non-repetitive indel profiles, and single base pair substitutions. FASTQSim allows the user to simulate individual read datasets that can be used as standardized test scenarios for planning sequencing projects or for benchmarking metagenomic software. In this regard, in silico datasets generated with the FASTQsim tool hold several advantages over natural datasets: they are sequencing platform independent, extremely well characterized, and less expensive to generate. Such datasets are valuable in a number of applications, including the training of assemblers for multiple platforms, benchmarking bioinformatics algorithm performance, and creating challenge datasets for detecting genetic engineering toolmarks, etc.
KeywordsSimulator Algorithm Next generation sequencing FASTQ
The advent of high-throughput sequencing technologies has enabled rapid characterization of clinical and environmental samples. The next generation sequencing revolution has seen the rise of multiple instruments and methodologies. With the decreasing cost of sequencing technology, sample processing and bioinformatics analysis pose the largest bottleneck to actionable data for critical medical and defense applications . A need exists for more accurate and rapid algorithms to process genetic data. Quantitative evaluation tools are needed to measure the performance of these algorithms. One approach to measuring algorithm accuracy involves executing the algorithm on in silico-generated datasets, which consist of a host backbone “spiked” with reads from other organisms and plasmids in known concentrations. Since the exact quantity of reads and genes from each source in the composite dataset is known, the degree to which an algorithm can report the dataset composition serves as a measure of the algorithm’s performance [2–4].
Popular in silico read simulators
Simulates both continuous long reads (CLRs) and circular
Limited insertion and deletion (indel)
consensus sequences (CCS); supports sampling-based
simulation (in which both length and quality scores are
sampled from a real read set) and model-based simulation
Simulates read length and quality in flow space
No indel support
Uniform read length
Roche 454, Illumina Solexa
Read error model, quality profiles
No simulation of indels for short
tandem repeats (STRs)
Single nucleotide polymorphism (SNP) simulation
Fixed mutation rate does not model
Shotgun or amplicon read libraries
Limited indel support
454, Illumina, Sanger
Simulation, assembly, mapping
Does not assign quality values to reads
Fixed length and mutation rates
Among in silico data generation tools that provide the capability to simulate read length and quality scores according to a user-specified distribution, many do not provide extensive support for generating insertions, deletions, and single base substitutions. The datasets generated by these tools consequently do not match instrument error profiles. For example, the GemSim tool uses a fixed length, fixed mutation rate model to simulate reads for the Roche 454 and Illumina sequencing platforms. Other tools, such as Flowsim in silico, generate data that is consistently better in terms of contig size than assemblies of real data. This is due to the fact that Flowsim generates all simulated reads from the reference genome in a manner such that 100% of the reads map back to the genome, whereas for real datasets generated with Roche 454, the percentage is closer to 98.7% . Other tools, such as ART and PBsim, do match the insertion/deletion (indel) profiles of NGS sequencers, but do not simulate short tandem repeat (STR) insertions or deletions. For example, in the case of PBsim, the deletion probability is uniform throughout all positions of every simulated read, which is computed from the mean error probability of the read set and the ratio of differences . This doesn’t model actual sequences, where indel rates vary in accordance with base position and other factors, such as repeat size. In summary, no current state-of-the art tool is able to generate in silico data that is completely indistinguishable from datasets generated by the intended target sequencing platform.
The FASTQSim software package was developed to characterize NGS datasets in FASTQ format and generate in silico reads with matching error profiles from reference sequences. FASTQSim is platform-independent and provides functionality to create spiked datasets by adding one or more organisms and plasmids to an existing dataset. It supports introduction of known sequence variants and allows for the creation of synthetic datasets that can be used for evaluation of bioinformatics tools.
The FASTQSim software package consists of two main components: FASTQcharacterize and FASTQspike. The tool FASTQcharacterize is used to analyze error profiles of existing datasets. The outputs of the FASTQcharacterize tool serve as inputs for the FASTQspike tool, which uses the supplied error profile to generate in silico reads and blend target sequences into a background dataset. Error profiles for common NGS platforms, including IonTorrent, Roche, PacBio, and Illumina, are included included with the software and can be used directly with FASTQspike without the need to run FASTQcharacterize first.
Dataset error profile characterization with the FASTQcharacterize tool
- 1.a target file to be characterize (FASTQ format)
- 2.one of the following:
reference file (FASTQ format)
a BLASTn output file for the target dataset against the reference of interest
a SAM/BAM alignment file of the target against the reference
In the included example, a dataset from sequenced human blood was used with the human genome reference. A read length distribution was generated empirically from the input FASTQ file. A distribution was also generated for quality scores as a function of base position along a read. The FASTA file was split into blocks for parallel processing (default block size is 1000 reads, but this parameter is customizable). BLASTn is used to align these blocks with the reference genome . By default, five blocks from the FASTA file were sampled at random, since it was experimentally observed that 5000 reads is generally sufficient to characterize most datasets. However, the FASTQcharacterize tool can be customized to sample any number of blocks with an option in the parameter file. An externally generated BLASTn result file can also be supplied to the tool for characterization. The Java BlastParser tool was then used to compare query reads to matching target sequences in the reference genome . This tool is available as a compiled Java jar file in Additional file 1.
Insertion size distribution
Deletion size distribution
Single point mutation rates
STR indel frequencies for repeats with 2, 3, …, n repeated bases
Quality of read alignment to the reference
Blended data generation for in silico projects with the FASTQspike tool
The FASTQspike tool uses the outputs of FASTQcharacterize to generate an in silico dataset. The tool provides the option to generate an in silico dataset from scratch or to add in silico reads to an existing background dataset. The reads are aggregated into an output FASTQ file in a manner such that the in silico reads are indistinguishable from the experimentally-generated background data. An additional FASTQ file that consists solely of spiked reads is also generated.
Background FASTQ. This input is optional. It is also possible to run FASTQspike without supplying a background file.
- 2.Background characterization profile. Profiles for common NGS platforms are included iwth teh FASTQsim distribution. These are described in Figure 2 (IonTorrent), Figure 3 (Illumina), Figure 4 (Roche), and Figure 5 (PacBio). Customized profiles can be generated with the FASTQcharacterize tool. The ability to generate customized read length, quality, and error distribution profiles enables a platform-independent approach to in silico data simulation.
Read length distribution
Quality score distribution
Instrument-specific insertion and deletion rates
Insertion and deletion size distribution (repeats)
Instrument-specific mutation rates
- 3.For each target organism
FASTA file with source sequence material. The indel and single point mutation rate profiles listed above refer to instrument-specific values.
Target genome/plasmid morphology (circular/linear)
Desired mean coverage
The first phase of the FASTQspike algorithm consists of generating reads for the target organisms so that the specified coverage is achieved. While target coverage is less than the specified value, the algorithm randomly selects a read start position and strand orientation in target genome to ensure realistic non-uniform target coverage. It also randomly selects read length from underlying background distribution. A parameter is used to specify minimum sequence length. This value is set to 50 by default, but can be altered by the user. Based on user-specified parameters, the algorithm can treat the source FASTQ as either a circular or linear DNA molecule, and reads are generated accordingly. For a circular plasmid genome, a read that runs off the end of the source DNA molecule will wrap around to the beginning, whereas a read from a linear genome will be truncated if it is too long. Each template spiked sequence is generated to have twice as many bases as the final desired sequence length. This provides a buffer region for the error profile matching step.
Once a set of sequences has been simulated from the target FASTA input, these sequences are modified to simulate sequencing errors. The probability distributions of these errors are generated to mimic the background distribution for deletions, insertions, and single point mutations. Insertions and deletions may consist of one or multiple base pairs. Indels may further be subdivided into two kinds: a random base indel or a short tandem repeat (STR) indel. Both random and STR indels are generated at a rate that matches the supplied error profile for the background dataset. As part of this process, linear regression is used to account for noise effects. Linear regression is also used to interpolate for missing or incorrect data points in the data characterization profiles.
The mean and standard deviation of the number of deletions per read for the background data is calculated. These parameters are used to fit a Gaussian distribution for the number of deletions in a read. This distribution is sampled to determine the number of deletions to perform for each read. If this number is non-zero, the deletion sizes are determined by randomly sampling from the deletion size distribution generated in the prior step. Next, statistics about the probability of deletion for a repeat of a given size are used to decide whether the deleted bases will contain a repeated sequence. If the sequence does not contain a repeat of the appropriate length, the repeat length is shortened by one base and the sequence is re-examined. This is repeated until a repeat of the determined size is located within the sequence, or the repeat count is reduced to 1. If a non-repeat is to be deleted from the sequence, the position of the deletion is determined by sampling from the deletion probability distribution.
Insertions and single base pair mutations are handled in the same manner as deletions. If a repeat is to be inserted, a position is determined from the insertion probability distribution, and a series of bases at that position are selected as the repeat unit to insert. If a non-repeat is to be inserted, the bases to insert are generated at random, with equal probability for each of the four bases. At the end of this phase, the spiked sequence is clipped to the desired length.
Finally, if a background FASTQ file is provided, the spiked reads are inserted into the background FASTQ file at random locations. Slices of the background FASTQ file are read into memory, each of which is 100 MB in size. A subset of the generated reads are chosen at random to spike into that portion of the file. The quality scores for each read in the background are separated into groups by the length of the read. For each spiked read, a quality string matching the length of this read is selected from the appropriate group. Read names are assigned to the spiked reads by randomly selecting a position in the background FASTQ file to insert the read and “interpolating” the read names of the prior and following sequence.The result is a blended FASTQ dataset that consists of both the background data and simulated reads, and is indistinguishable from the background data. As illustrated in Figure 6, the characterization profile of the blended dataset is identical to that of the source dataset.
Results and discussion
Speed and memory
To test FASTQSim’s speed and memory, the example whole blood IonTorrent dataset was characterized with the FASTQcharacterize tool. The dataset contains 319,365 reads, with a mean length of 160 bases. The characterization software ran in 13 min., 40 s. and utilized an average of 1.2 GB of RAM. The dataset was then spiked with E. coli str. K-12 substr. MG16555 [Genbank:NC_000913.2] at a mean coverage of 20 ×. BioBrick cloning vector pSB3C5-I52001 [Genank:EU496103.1] reads were spiked into the same dataset at a coverage of 200 ×. The NGSpike software is parallelized for multi-threaded execution. Executing the software with a single thread resulted in a runtime of 3 h., 24 min., 10 s. and utilized an average of 1.6 GB of RAM. Increasing the number of threads to 30 reduced led to a runtime of 1 hour, and further increasing the number of threads to 100 allowed for code execution in 30 minutes. A logarithmic drop in runtime was thus observed by assigning additional threads for NGSpike execution. Algorithm runtime scales linearly with datasets size. The software was run on a Linux machine with a 1400 MHz CPU running CentOS 5.
Composition of Illumina in silico dataset generated with FASTQsim for the DTRA metagenomic algorithm challenge
Number of reads
Number of genes
Bacteria, Proteobacteria, Gammaproteobacteria, Thiotrichales, Francisellaceae, Francisella, tularensis.
Bacteria, Proteobacteria, Alphaproteobacteria, Rhizobiales, Methylobacteriaceae, Methylobacterium
radiotolerans JCM 2831. [Genbank:CP001001.1]
Bacteria, Proteobacteria, Gammaproteobacteria, Pseudomonales, Pseudomonadaceae, Pseudomonas
aeruginosa pao1. [Genbank:NC_002516.2]
Bacteria, Actinobacteria, Actinobacteridae, Actinomycetales, Corynebacterinae, Mycobacteriaceae,
Mycobacterium avium complex (mac). [Genbank:EU854994.1]
Bacteria, Firmicutes, Bacilli, Lactobacillales, Streptococcaceae, Streptococcus pneumoniae ATCC 700669.
Bacteria, Proteobacteria, Gammaproteobacteria, Legionellales, Legionellaceae, Legionella pneumophila
Philadelphia 1. [Genbank:NC_002942.5]
Human immunodeficiency virus I. [Genbank:NC_001802.1]
FASTQSim was also used to simulate datasets for the MITLL Bioinformatics Challenge Day, which required participants to identify and interpret the signatures of genetic engineering in a metagenomics dataset. A human whole blood background was sequenced with the IonTorrent platforma. Instructions for accessing the resulting FASTQ file are provided in Additional file 2. The BLAST algorithm was used to characterize the background dataset.
The target sequences for in silico inclusion underwent a series of modifications to model a scenario in which the E. coli K-12 MG1655 mutator strain was used as a host for the Enterobacteria phage lambda [Genbank:J02459.1]. The host E. coli strain had several genes deleted and several others turned off with multiplex automated genome engineering (MAGE) to accelerate the evolution of the phage . The phage itself was subjected to codon substitution and rearranging to replace the codons AGT, AGC, AGA, AGG, TAG, TTA, TTG with other codons for the corresponding amino acids . The modified phage was spliced into the E. coli genome, and FASTQSim was used to insert the engineered E.coli strain into the human blood background at a concentration of 17 ×. FASTQSim was used to spike the BioBrick cloning vector pSB3C5-I52001 [Genbank:EU496103.1] into the human blood background at a concentration of 12 × relative to the E. coli organism. The resulting dataset consisted of 46% reads generated with FASTQSim. Instructions for accessing the individual source files and the combined file generated for the Challenge Day by FASTQSim are provided in Additional file 2.
Newbler characterization for high coverage in silico IonTorrent dataset
Pct of all unique
Escherichia coli str. K-12 substr. MG1655,
gi |215104|gb |J02459.1
Enterobacteria phage lambda, complete
genome, with codon substitution
BioBrick cloning vector pSB3C5-I52001,
The emergence of next-generation sequencer technology has greatly increased the number and scope of genomic sequencing projects. Gigabases of data can be generated in a few hours, demanding rapid and accurate analysis algorithms and software. However, there are currently limited options to produce individual, simulated test cases for algorithm benchmarking. FASTQsim is a platform-independent tool for producing simulated read data sets, useful for designing sequencing projects and for testing and comparing bioinformatics or assembly software. Inputs to FASTQsim can be adapted to generate user defined sequence sets that can serve as verified example data.
Availability and dependencies
FASTQSim is available to download from SourceForge:
Project name: FASTQSim
Project home page: https://sourceforge.net/projects/fastqsim
Operating system: Linux
Programming language: Shell scripts, Python
Python v.2.7 http://www.python.org/download/releases/2.7.5/
matplotlib v.1.1.0+ http://matplotlib.org/downloads.html
numpy v.1.7.1+ http://www.scipy.org/install.html
Java Blast Parser (included) v.1.0
License: GNU GPL v.3
A gzipped tar archive of the FASTQsim source code, README, and license is provided in Additional file 3. A shell executable script is provided in Additional file 4 to demonstrate the functionality of the FASTQsim software. Links for obtaining the necessary data files to execute the example are provided in Additional file 2.
a Datasets for the study were supplied by Dr. C Nicole Rozenzweig at the Edgewood Chemical/Biological Center.
This work is sponsored by the Defense Threat Reduction Agency under Air Force Contract # FA8721-05-C-0002. Opinions, interpretations, recommendations and conclusions are those of the authors and are not necessarily endorsed by the United States Government.
The author wishes to thank
1. Dr. Darrell O. Ricke for kindly providing the BlastParser tool for use with the FASTQSim software, as well as for valuable discussions and input throughout the algorithm development process.
2. Dr. C. Nicole Rozenzweig for providing IonTorrent, PacBio, Roche 454, and Illumina datasets.
3. Dr. Peter Carr for assisting with the creation of the genetic engineering dataset used in the Bioinformatics Challenge Day.
4. Nelson Chiu for evaluating accuracy of leading metagenomic algorithms on in silico datasets generated with FASTQSim.
5. Dr. Anthony Lapadula and Joseph Isaacson for assistance with code review and helpful suggestions.
6. Edward Wack for leading the Bioinformatics Challenge Day and Metagenomics Algorithm Contest projects for which the FASTQSim tool was originally developed.
- Shendure J, Ji H:Next-generation DNA sequencing. Nat Biotech. 2008, 26: 11335-1145.Google Scholar
- Frampton M, Houlston R:Generation of artificial FASTQ files to evaluate the performance of next-generation sequencing pipelines. PLoS ONE. 2012, 7: [http://www.plosone.org/article/info\%3Adoi\%2F10.1371\%2Fjournal.pone.0049110],Google Scholar
- Myers G:A dataset generator for whole genome shotgun sequencing. Proc Int Conf Intell Syst Mol Biol. 1999, 1999: 202-210.Google Scholar
- Engle M, Burks C:Artificially generated data sets for testing DNA sequence assembly algorithms. Genomics. 1993, 16: 286-288. 10.1006/geno.1993.1180.PubMedView ArticleGoogle Scholar
- Lin L, Yinhu L, Siliang L, Hu N, He Y, Pong R, Lin D, Lu L, Law M:Comparison of next-generation sequencing systems. J Biomed Biotechnol. 2012, 2012: [http://dx.doi.org/10.1155/2012/251364],Google Scholar
- Carneiro M, Russ C, Gross M, Gabriel S, Nusbaum C, DePristo M:Pacific biosciences sequencing technology for genotyping and variant discovery in human data. BMC Genomics. 2012, 13: [http://www.biomedcentral.com/1471-2164/13/375],Google Scholar
- PacificBioSciences:Understanding PacBio transcriptome data. 2013, [https://github.com/PacificBiosciences/cDNA_primer/wiki/Understanding-PacBio-transcriptome-data],Google Scholar
- Balzer S, Malde K, Lanzén A, Sharma A, Jonassen I:Characteristics of 454 pyrosequencing data–enabling realistic simulation with flowsim. Bioinformatics. 2010, 26: 420-425. 10.1093/bioinformatics/btq365.View ArticleGoogle Scholar
- Yukiteru O, Kiyoshi A, Michiaki H:PBSIM: PacBio reads simulator–toward accurate genome assembly. Bioinformatics. 2013, 29: 119-121. 10.1093/bioinformatics/bts649.View ArticleGoogle Scholar
- Heng L:Whole Genome Simulation. 2012, [http://sourceforge.net/apps/mediawiki/dnaa/index.php?title=Whole_Genome_Simulation],Google Scholar
- Huang W, Li L, Myers J, Marth G:ART: a next-generation sequencing read simulator. Bioinformatics. 2012, 28: 593-594. 10.1093/bioinformatics/btr708.PubMedPubMed CentralView ArticleGoogle Scholar
- Maq: Mapping and Assembly with Qualities. 2008, [http://maq.sourceforge.net/],
- Angly FE, Willner D, Rohwer F, Hugenholtz P, Tyson GW:Grinder: a versatile amplicon and shotgun sequence simulator. Nucleic Acids Res. 2012, 40: 94-10.1093/nar/gks251.View ArticleGoogle Scholar
- Richter D, Ott F, Auch AF, Schmid R, Huson DH:MetaSim: a sequencing simulator for genomics and metagenomics. PLoS One. 2008, 3: 3373-10.1371/journal.pone.0003373.View ArticleGoogle Scholar
- McElroy K, Luciani F, Thomas T:GemSIM: general, error-model based simulator of next-generation sequencing data. BMC Genomics. 2012, 13: [http://www.biomedcentral.com/1471-2164/13/74],Google Scholar
- Altschul S, Gish W, Miller W, Myers E, Lipman D:Basic local alignment search tool. J Mol Biol. 1990, 215: 403-410. 10.1016/S0022-2836(05)80360-2.PubMedView ArticleGoogle Scholar
- Ricke D:Java BlastParser. [http://sourceforge.net/projects/biotools/files/?source=navbar],
- Innocentive:Identify Organisms from a Stream of DNA Sequences. 2013, [http://www.innocentive.com/dtra],Google Scholar
- Segata N, Waldron L, Ballarini A, Narasimhan V, Jousson O, Huttenhower C:Metagenomic microbial community profiling using unique clade-specific marker genes. Nature Methods. 2012, 9: 811-814. 10.1038/nmeth.2066.PubMedPubMed CentralView ArticleGoogle Scholar
- Wood DE, Salzberg SL:Kraken:ultrafast metagenomic sequence classification using exact alignments. Genome Biol. 2014, 15: [http://genomebiology.com/2014/15/3/R46],Google Scholar
- Liu B, Gibbons T, Ghodsi M, Pop M:MetaPhyler: taxonomic profiling for metagenomic sequences. IEEEXplore. 2010, 2010: 95-100.Google Scholar
- Liu J, Wang H, Yang H, Zhang Y, Wang J, Zhao F, Qi J:Composition-based classification of short metagenomic sequences elucidates the landscapes of taxonomic and functional enrichment of microorganisms. Nucleic Acids Res. 2013, 41: [http://nar.oxfordjournals.org/content/41/1/e3],Google Scholar
- Ames SK, Hysom DA, Gardner SN, Lloyd GS, Gokhale MB, Allen JE:Scalable metagenomic taxonomy classification using a reference genome database. Bioinformatics. 2013, 18: 2253-2260.View ArticleGoogle Scholar
- Wang H, Isaacs F, Carr P, Sun Z, Xu G, Forest C, Church G:Programming cells by multiplex genome engineering and accelerated evolution. Nature. 2009, 460: 894-898. 10.1038/nature08187. [http://www.nature.com/nature/journal/v460/n7257/full/nature08187.html],PubMedPubMed CentralView ArticleGoogle Scholar
- Shcherbina A:Codon Substitution Script. 2013, [https://github.com/annashcherbina/CodonSub],Google Scholar
- 454 Sequencing:Point-and-click tools for assembly, mapping and amplicon variant analysis. 2013, [http://454.com/products/analysis-software/index.asp],Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.