Next generation sequencing reads comparison with an alignmentfree distance
 Emanuel Weitschek^{1, 2}Email author,
 Daniele Santoni^{2},
 Giulia Fiscon^{2, 3},
 Maria Cristina De Cola^{4},
 Paola Bertolazzi^{2} and
 Giovanni Felici^{2}
https://doi.org/10.1186/175605007869
© Weitschek et al.; licensee BioMed Central Ltd. 2014
Received: 5 May 2014
Accepted: 20 November 2014
Published: 3 December 2014
Abstract
Background
Next Generation Sequencing (NGS) machines extract from a biological sample a large number of short DNA fragments (reads). These reads are then used for several applications, e.g., sequence reconstruction, DNA assembly, gene expression profiling, mutation analysis.
Methods
We propose a method to evaluate the similarity between reads. This method does not rely on the alignment of the reads and it is based on the distance between the frequencies of their substrings of fixed dimensions (kmers). We compare this alignmentfree distance with the similarity measures derived from two alignment methods: NeedlemanWunsch and Blast. The comparison is based on a simple assumption: the most correct distance is obtained by knowing in advance the reference sequence. Therefore, we first align the reads on the original DNA sequence, compute the overlap between the aligned reads, and use this overlap as an ideal distance. We then verify how the alignmentfree and the alignmentbased distances reproduce this ideal distance. The ability of correctly reproducing the ideal distance is evaluated over samples of read pairs from Saccharomyces cerevisiae, Escherichia coli, and Homo sapiens. The comparison is based on the correctness of threshold predictors crossvalidated over different samples.
Results
We exhibit experimental evidence that the proposed alignmentfree distance is a potentially useful readtoread distance measure and performs better than the more time consuming distances based on alignment.
Conclusions
Alignmentfree distances may be used effectively for reads comparison, and may provide a significant speedup in several processes based on NGS sequencing (e.g., DNA assembly, reads classification).
Keywords
Sequence analysis Next generation sequencing AlignmentfreeBackground
The development of Next Generation Sequencing (NGS) machines allows the extraction of an extremely large amount of reads (i.e., short fragments of an organism’s genome) at low cost. The length of such reads is very small when compared to the length of a genome: it may range from 40 to 300 base pairs (bp) (i.e., characters), while the length of a simple genome (e.g., bacteria) is in the order of millions base pairs (Mbp). Three main NGS technologies are currently used[1]: Roche 454, Illumina, and Ion Torrent. At present, Illumina technology performances are 40 gigabase pairs (Gbp) per day at a low cost per bp [illumina.com] with reads average length of 70 bp; Roche 454 performances are 1 Gbp per day at a higher cost with reads average length of 250 bp [454.com]; Ion Torrent machines produce reads of 200 bp with a throughput of 5 Gbp per day at a low cost per bp[2].
DNA assembly can be defined as the reconstruction of a genome, starting from a large number of short overlapped fragments (reads) obtained by a sequencing operation. The length of each read and the number of reads are determined by the type of sequencer. The complexity of the assembly process stems from the length and number of the reads: longer reads are easier to be assembled, while a larger number of short reads requires a higher computational effort, although providing more information. Typically, the number of reads produced by NGS experiments reaches several millions or more, depending on the sequencing coverage and on its depth. The use of NGS machines results in much larger sets of reads to be assembled, posing new problems for computer scientists and bioinformaticians, whose task is to design algorithms that align and merge the reads for an effective reconstruction of the genome (or large portions of it) with sufficient precision and speed[3].
Many competing algorithms have been developed for DNA assembly: a comprehensive comparison of recent and wellestablished ones can be found in[4] and[5], where these methods are tested on common benchmarks. The assembly problem is proven to be NPhard[6] and several heuristic algorithms have been proposed. Algorithms for DNA assembly are based on two main approaches: overlap graphs (e.g.,[7]) and De Bruijn Graphs[4]. In an overlap graph each read corresponds to a node, and the overlaps between read pairs  that define the weights of the arcs  are usually computed by means of alignment methods; an assembly is derived from an Hamiltonian path in this graph. In the De Bruijn Graphs approach, reads are represented on a graph whose nodes and edges are nucleotide subsequences of length k (called kmers)[8]; an edge corresponds to an overlap between two nodes. The assembly is found searching for an Eulerian cycle in this graph and it is represented by a sequence of edges. Several assembly software tools (e.g., ABySS[9], Velvet[10], and SoapDeNovo[11]) use subsequences of fixed dimensions (kmers) for building the De Bruijn graph. These and other wellestablished assembly algorithms (e.g., Ssake, Sharcgs, Vcake, Newbler, Celera Assembler, Euler, and AllPaths) are described and compared in[12]. We note that the role of kmers in the assembly approaches based on De Bruijn graph is substantially different from the role they play in the the definition of the alignmentfree distance described later. In fact, the De Bruijn graph uses kmers as nodes of the graph and does not consider their frequency, while our approach is based on the frequency of kmers to assess reads similarity.
A large number of these algorithms  in particular, those using the overlap graphs  are based on the similarity between reads. Such a similarity is the main way to assess whether two reads may be overlapped in the reconstruction process or not. In these approaches, such a measure is hence required to compare each read pair, generating a number of comparisons that is potentially quadratic in the number of reads. Therefore, it is extremely important to develop methods that can quickly establish whether two reads are similar or not.
In this paper, we focus on alignmentfree techniques that have been proven to be effective in sequence analysis[13, 14]. These techniques can be classified into two main groups: methods based on sequence compression and methods that rely on subsequence (oligomers) frequencies[13]. The aim of the methods belonging to the first group is to find the shortest possible description of the sequence. They compute the similarity of the sequences by analyzing their compressed representations. Currently available methods are based on the Kolmogorov complexity[15] and on Universal Sequence Maps[16]. An extensive review can be found in[17]. The methods based on oligomers frequencies rely on the computation of the substring frequencies of a given length k in the original sequences, called kmers. Here, the similarity of two sequences is based only on the dictionary of subsequences that appear in the strings, irrespective of their relative position[17].
The alignmentfree distance adopted in this study is inspired to the kmer frequency analysis[18], where the frequencies of the kmers are represented in a real vector, and hence they are easily tractable in a mathematical space: the distance between two reads is obtained by the distance between their frequency vector representations. A simple and easy way to compute a distance measure is the Euclidean distance, although others may be used (e.g., the d 2 distance of[19]). The goal of this paper is to evaluate the reliability of an alignmentfree distance for read pairs similarity and to compare it with respect to other readtoread distances that are based on global or local alignment of the two reads.
The paper is organized as follows.
In section Methods, we provide sufficient background for the main methods and techniques used in the paper: the different adopted read pairs distances are described (subsections Bowtie distance, NeedlemanWunsch edit distance, The Blast alignment distance and Alignmentfree distance on tetramer frequencies). Following, we outline the rationale of threshold predictors and the way they are computed from data. Section Results and discussion describes the experimental design and its results. First, we delineate the data sets extraction and the experimental procedure (subsection Data sets and experimental settings). Then, we consider the computational performances of the different distances (subsection Computational time analysis of the threshold predictors), how they correlate among each other (subsection Pearson correlation among distances), their prediction performances over the training sets with the support of ROC curves and AUC indicators (subsection Performance analysis of the threshold predictors), and their predictive results for a cross validation evaluation scheme (subsection Cross validation performances of the AF threshold predictor). Finally, we provide discussion of the results (subsection Final discussion). In section Conclusions we delineate the conclusions and the perspectives of the work.
Methods
We consider a straightforward implementation of the alignmentfree distance, based on the euclidean distance of the frequency distribution of kmers (i.e., substrings composed of k consecutive bases) in the two reads. Such a distance, referred to as AF in the following, is very simple to compute and requires linear time in the dimension of the reads. As far as the choice of the length of the oligomers, we adopt k=4 (tetramers) as in many references this value has been confirmed to provide an ideal balance between the length of the oligomers and their number, when the sequences are expressed in the (A, C, G, T) alphabet[20–22]. AF is compared with respect to two methods to measure DNA string similarity that are based on sequence alignment: the NeedlemanWunsch edit distance (NW) and the Blast alignment algorithm (BL).
Both methods require quadratic time in the length of the reads. Their choice is motivated by the fact that the first is a global alignment method, i.e., it searches for the best alignment of the complete reads, while the second is a local alignment, i.e., it searches for the longest possible portion that is aligned well within the two reads. Therefore, their choice covers the two main approaches used in computing alignmentbased distances.
To perform a proper comparison among AF, NW, and BL we adopt the following test. First, we assume the existence of an ideal distance, i.e., the distance that is given by the degree of overlapping of reads that have been aligned on their known reference genome. Second, we verify the ability of the three distances in approximating this ideal (target) distance. Given a pair of reads, such an approximation is measured by the ability of predicting the value of the target distance using the value of the predicting one. This assumption is based on the fact that an assembly method that uses the target distance to evaluate the opportunity of overlapping two reads would result in a extremely satisfactory assembly.
To align the reads over the original sequence, we use the wellestablished Bowtie algorithm[23, 24]; two reads receive a maximum distance value if they do not overlap over the reference sequence; otherwise, they receive a distance inversely proportional to their degree of overlapping over the sequence (e.g., they would have minimum distance if they are aligned in the same position by the Bowtie algorithm). Given two reads, we define such a value their Bowtie distance (BT in the following). We refer to BT as the target distance and either to AF, or NW or BL as the predictor distance. A threshold predictor is a mapping between the values of the target distance and the values of the predictor distance; in other words, it assigns to each value of the target distance, say α, a value of the predictor distance, say β. Informally, we may define the threshold predictor as a mapping m such that m(α) = β. Then, the target distance between two given reads is predicted to be below α when the predictor distance between the same two reads is below β.
According to the above definition, for each value of the target distance the threshold predictor may incur in errors in terms of false positive and false negative predictions. The quality of the threshold predictor is given by the error distribution over the predicted values of the target distance.
To test our method, we consider DNA sequences of three different organisms: Saccharomyces cerevisiae, Escherichia coli, and Homo sapiens. Publicly available sets of NGS reads for the three reference sequences are used. Each experiment is based on a large sample of read pairs, from which the best possible threshold predictor (among AF, NW, or BL) of the BT distance value is computed. The precision of the predictors is evaluated building ROC curves both on the samples of read pairs used to identify the best predictors (training data), and on other samples from the same set of read pairs not used for training (testing data). The results show how AF performs very well as a threshold predictor for BT; its performances are indeed better than those of NW and comparable to those exhibited by BL. Furthermore, both NW and BL are much more demanding in terms of computing time when compared with respect to AF.
Bowtie distance
The Bowtie distance (BT) is obtained after computing the alignments of the reads to the reference genome with the Bowtie algorithm[23, 24]. Bowtie is able to align reads to the reference genome at a very high speed (25 million reads of 35 bp length per hour).
where ∇(r_{1},r_{2}) is the number of overlapped positions of r_{1} and r_{2}, λ_{1} is the length of r_{1}, and λ_{2} is the length of r_{2}. If multiple alignments of the same reads are present, their average is used.
NeedlemanWunsch edit distance
The Needleman and Wunsch algorithm (NW)[25], based on dynamic programming, is commonly used to perform a global alignment of two sequences. The algorithm time complexity is quadratic with respect to the lengths of the two sequences (N and M) to be aligned (O(n ∗ m), where n and m are the number of bases in the two reads). The NeoBio[26] Java implementation of the NW algorithm is adopted for performing the distance evaluation experiments. We adopt following parameter settings for the NW algorithm:

+1 for the reward of a match (i.e., a substitution of equal characters);

1 for the penalty of a mismatch (i.e., a substitution of different characters);

1 for the cost of a gap (i.e., an insertion or deletion of a character).
We use the abovementioned configuration in order to assign an equally balanced score for a match (+1), a mismatch (1), and a gap (1). For further details we point the reader to the NeoBio documentation[26]. The NW distance is obtained from the NeedlemanWunsch score in two steps. First, the score is subtracted to its maximum possible value (perfect alignment) in order to obtain null distance in case of equal sequences and large distance for different ones; then, it is normalized between 0 and 1 to ease the comparisons with the other measures.
The Blast alignment distance
Blast parameters setting
Parameter  Value  Description 

p  blastn  Blast program for nucleotide sequences 
F  F  Masking and filtering off 
w  4  Windows size 
i  r1.fas  First input filename 
j  r2.fas  Second input filename 
m  8  Alignment view set to tabular output 
Alignmentfree distance on tetramer frequencies
We provide a simple sketch of the alignmentfree distance computation used in this paper, mainly based on[13]. The frequencies of each substring of length 4 (also called tetramers) are computed by counting the occurrences of the substrings in the read with a sliding window of length 4, starting at position 1 and ending at position n  4 + 1, where n is the length of the read. For the alphabet composed of the four symbols (A,C,G,T) we have a total of 4^{4} = 256 different tetramers and thus each read is represented by a vector of 256 real numbers between 0 and 1. The choice of tetramers is motivated by[20–22], which confirm the ideal balance between the length of the oligomers and their number. Given two reads, the Euclidean distance between their associated frequency vectors is an inverse measure of the similarity of the two reads, and we refer to it as the AF distance between the two reads. An efficient Java implementation of the alignmentfree frequency vector computation and representation was developed for computing the AF distance between the available read pairs. The related algorithm is linear with respect to the length of the reads and is available at dmb.iasi.cnr.it/ngs_distances.php.
Threshold distance predictors
Our goal is to show how the AF distance between two DNA reads can approximate the BT distance, taking into account a tolerable degree of accuracy. In greater details, we aim to show that AF approximates BT as well as NW or BL distances, although less computationally demanding.
The threshold predictor depends on the choice of the value of d_{1}(·,·) in the vector α. We are indeed interested in the prediction only if d_{1}(r_{1},r_{2}) is below a certain value based on the value of d_{2}(r_{1},r_{2}), and would like this prediction to be precise for small reference values (i.e., those contained in the vector α).
As anticipated, we have BT as target distance (i.e., d_{1}(·,·)) and the other distances as predictors (i.e., d_{2}(·,·)). Since the original sequence is unknown, it is not always possible to compute the BT distance. Hence, we focused on predicting the BT distance by means of NW, BL or AF. In this context, a threshold predictor which is precise for small values in α turns out to be very useful. Thereby, we are not interested in predicting whether two reads are far from each other: we only want to know if they are close to each other or not.
A proper way to evaluate the quality of a threshold predictor is to measure its errors over one or more samples of read pairs where all distances are known. For each value α_{ i } we measure the true positive (i.e., read pairs that are below α_{ i } according to the target distance and are predicted to be below α_{ i } by the threshold predictor) and true negative (i.e., read pairs that are above α_{ i } according to the target distance and are predicted to be above α_{ i } by the threshold predictor) rates associated with the above rule, and from this derive standard performance indicators such as ROC curves and AUC values[29].
Read pair samples are used also to identify and test good threshold predictors. Given the value α = (α_{1},α_{2},…,α_{ m }), we compute for a sufficiently large set of candidate values β = (β_{1},β_{2},…) the true positive and the true negative rates, construct the associated ROC curve for each value α_{ i }, and derive the corresponding AUC value. If the AUC value is good enough, we identify the value β_{ j } that provides the largest combination of true positive and true negative rates, and adopt that for α_{ i }. Then, a complete threshold predictor is obtained by repeating this operation for each α_{ i },i = 1,m.
The measure of a distinct precision value for each level of the target function enables to evaluate the reliability of the predictors there where it is needed. Clearly, the validity of a threshold predictor depends on the quality and the representativeness of the samples used to train (e.g., to derive the predicting vector β) and test the method. For the latter we adopt a standard crossvalidation approach: first, the read pairs are sampled in disjoint sets; then some of these sets are used for training (e.g., derive the best values of β for the given values of α) and others are used for testing (measure the error of the so obtained threshold predictor). In several iterations, the role of training and testing samples is exchanged in order to mitigate the potential bias associated with the sampling.
The set of reference values α (for the target distance) and β (for the predictors) that have been used for the experiments are the values that separate the percentiles of the read pair distance distribution. In this way, we have that the first component of the α vector is larger than 1% of the sampled read pairs, the second is larger than 2%, and so on (similarly for the β vector). This allows to sample the whole variation range of the normalized distances, obtaining a finer granularity in the portions where the density is higher. According to this choice, both α and β are vectors composed of 100 real values between 0 and 1 in nondecreasing order. Clearly, this choice may be changed with equally spaced intervals without a significant effect on the results, once the proper granularity of the intervals has been identified.
Data sets and experimental settings
In this subsection, we describe the adopted NGS data sets and the experimental setting. Three different organisms are taken into account, Saccharomyces cerevisiae (commonly known as yeast), Escherichia coli, and Homo sapiens (commonly known as human).
We design and apply the following experimental procedure:

N reads are downloaded from the NCBI Sequence Read Archive (SRA) database[30], or Chang Gung University, Department of Parasitology, College of Medicine (CGU)[31], and different NGS platforms;

By using the Bowtie algorithm[23, 24] the reads are aligned to the corresponding reference genome ([32, 33]);

From the resulting alignments a random selection of rs reads is computed and a reverse complemented representation is calculated, obtaining a total of rtot reads;

Out of all the possible pairs of different reads from this set, six subsets are selected, each with rp read pairs. In order to have half of the set with non overlapping reads (e.g., maximum Bowtie distance) and the other half with a variable degree of overlap, the random selection of these six subsets is controlled;

The four distances are then computed for each pair in the set: the Bowtie Distance BT, the Needleman and Wunsch edit distance NW, the Blast score BL, and the alignmentfree distance AF over the tetramers (i.e., substrings of length 4);

These measures are all turned into proper distances (see section Methods) ranging from 0 to 1 with 0 corresponding to equal sreads and 1 corresponding to maximally different reads.
In the following the six datasets are referred as YA, YB, …, YF (Y as in yeast), EA, EB, …, EF (E as in E. coli), HA, HB, …, HF (H as in human).
Compact overview of the datasets
Datasets  

Yeast  E. coli  Human  
Genome length  12.1 Mb  4.6 Mb  3.2 Gb 
Sequencing machine  Illumina HiSeq  Roche 454  Illumina GA II 
Database  NCBI SRA  CGU  NCBI SRA 
Accession number  ERX191563    SRX013970 
Run id  ERR216898    SRR031057 
Number of downloaded reads ( N )  3,551,079  436,142  14,267,012 
Avg. reads length ± st.dev  100 ±6  235 ±4  75 ±5 
Total base pairs  355.0 M  102.5 M  1.1 G 
Random selection of aligned reads ( rs )  54,860  100,000  183,672 
Total number of selected reads ( rtot )  109,720  200,000  367,344 
Read pairs in each subset rp  1 M  200,000  1 M 
Source chromosome  chr1    chr1 
It is worth noting that the choice from different platforms (Roche 454, Illumina GA II, and Illumina HiSeq) stems from three main reasons: first, we want to test our methods on different read lengths; second we aim to show that the performances of our distance are independent from the selected sequencing technology; lastly, these platforms are the most common ones.
Results and discussion
The main goal of this work is to provide evidence that the AF distance is a suitable approach to approximate BT distance. We apply AF to the three different data sets described in subsection Data sets and experimental settings, showing the performances with respect to other two alignment based algorithms (NW, BL). As a first step, we compute the Pearson correlation coefficients among the distances in the read pairs samples; then, we compute the ability of each measure to predict BT distance at given BT thresholds, by ROC curves and the corresponding AUC values. We verify the consistency of the predictions by a cross validation scheme detailed in the following sections.
Computational time analysis of the threshold predictors
All software implementations of BT, NW, BL, and AF are run under a 64 bit linux environment (kernel 2.6.262amd64) with a 64 bit Oracle Java Virtual Machine (version 1.7.0_09) on an Intel Core i7 920 2.67 GHz processor with 24 GB RAM memory, 1 TB sata 7200rpm hard disk, and a Debian GNU Linux 5.0.10 operating system.
Computational time analysis
Reads pairs  1.00 E+4  1.00 E+6  1.00 E+8  

Time [sec]  User  System  Elapsed  User  System  Elapsed  User  System  Elapsed 
AF  2.09  0.44  1.95  91.42  36.89  126.96  10230.33  3530.08  13541.00 
NW  11.98  0.42  11.74  1466.49  34.03  1501.03  362794.34  3686.95  365785.00 
Blast  122.21  81.14  199.80  10203.07  7434.90  18747.00  1418254.45  946049.60  2365124.00 
The results highlight the much lower running time requirements of the AF distance. From our experimental results we see that the running time of AF is approximately 10 times smaller than NW, that is in turn 10 times smaller than BL.
Regarding memory requirements and consumption, we note that if the algorithms compute the distance measures by loading all n ∗ n read pairs of average length l into memory, then they will require l ∗ n bytes (online implementation); else if they perform the computation separately for each read pair, then the memory consumption is 2l bytes (offline implementation).
Pearson correlation among distances
Pearson correlation matrix between the four readtoread distances for Yeast  YA
BT  NW  BL  AF  

BT  1.00  0.45  0.81  0.63 
NW  0.45  1.00  0.48  0.52 
BL  0.81  0.48  1.00  0.61 
AF  0.63  0.52  0.61  1.00 
Pearson correlation matrix between the four readtoread distances for Human  HA
BT  NW  BL  AF  

BT  1.00  0.68  0.72  0.67 
NW  0.68  1.00  0.73  0.72 
BL  0.72  0.73  1.00  0.63 
AF  0.67  0.72  0.63  1.00 
Pearson correlation matrix between the four readtoread distances for E. coli EA
BT  NW  BL  AF  

BT  1.00  0.76  1.00  0.95 
NW  0.76  1.00  0.76  0.82 
BL  1.00  0.76  1.00  0.95 
AF  0.95  0.82  0.95  1.00 
For each organism, the correlations are computed in one of the six available samples. Similar results are obtained on the other samples (not shown). It is of interest to analyze the correlation of the predictor distances (NW, BL, AF) with the target distance BT. First, we note that the correlations measures are significantly different in the three organisms; in yeast the NW distance is extremely poorly correlated with BT, while such a correlation improves for E. coli and human; the correlation between AF and BT is also weaker in yeast than in the other two organisms. The BL correlation with BT appears to be the higher among the three predictors. Moreover, it is evident that BT distance is almost perfectly reproduced from the predictors BL and AF in E. coli, then followed by yeast and human.
We could not found our conclusions only on the correlations values. Indeed, the requirement of a linear dependence between target and prediction distances may be a biased condition for the existence of the BT threshold predictor. Correlation represents an average similarity over the whole scale of the target, whereas some (small) reference values of the target distance need to be predicted with higher accuracy. Hence, more appropriate evaluations reported on the following sections are used.
Performance analysis of the threshold predictors
In this section, we analyze the performances of the three predictors on the target distance. As abovementioned, we consider 100 intervals of the target BT distance corresponding to the percentiles of its distribution, and identify by exhaustive inspection the percentiles of the predictor distance that minimize the prediction error. Such an analysis is performed by means of ROC curves, where we plot the true positive rate against the false positive rate for a given percentile of the target distance, with the percentiles of the predictor distance varying from 1 to 100. We recall that an ideal ROC curve contains the point (0,1) and therefore the area under the ROC curve (AUC) has value 1. Smaller values of AUC represent poorer prediction performances, and, in general, an AUC value is usually considered very good when in the proximity of 0.9.
The higher the percentiles (i.e., the smaller the overlapping), the higher the noise in the prediction will be. AUC values are indeed very high for smaller percentiles with the exception of NW in human. In Figure4 panel A (yeast), there is evidence that BL and AF have both good performances for all the percentiles in terms of AUC, showing values higher than 0.9, until percentile 30, and anyway values higher than 0.8 for the last percentiles. BL performs slightly better than AF until the percentile 20, then AF is better until the percentile 60 and again BL is better until the last percentiles. NW AUC values range from 0.72 until 0.68 showing again a light decreasing slope. Figure4 panel B (E. coli) shows  as previously highlighted  that the three measures have very good performances for this organism, with AUC values close to 1 until percentile 33. This means that all the three measures are able to correctly predict BT. From the percentile 33 AUC values of NW significantly decrease, while those of AF and BL are still close to 1 until the percentile 80, when they slowly decrease keeping anyway values higher than 0.9. In Figure4 panel C (human) it can be observed that the three curves start from an almost common AUC value, around 0.95, but diverge with increasing percentiles. AF has the best performance keeping its AUC values higher than 0.9, then NW decreasing until 0.85, and finally BL falling down to 0.55.
Cross validation performances of the AF threshold predictor
The results discussed above show that the BL and AF predictors perform well when they are evaluated on the same sample that has been used to train the predictors reference values. It is more interesting to verify if the relation between the predictor and the target distance, derived from a read pairs sample, maintains its validity also on other samples that were not used to train the method.
True positive (TP) and true negative (TN) rates for reference values of target distance BT when predicted by AF, for yeast
Set used for  0.105  0.15  0.205  0.25  

training the predictor  TP [%]  TN [%]  TP [%]  TN [%]  TP [%]  TN [%]  TP [%]  TN [%] 
YA  90.26  85.05  90.00  85.80  89.13  86.76  87.96  87.57 
YB  90.03  85.23  89.75  86.01  89.69  86.20  87.94  87.61 
YC  90.01  85.28  89.72  86.06  88.44  87.34  87.39  88.09 
YD  90.23  85.03  89.74  86.03  89.12  86.76  88.58  86.94 
YE  90.73  84.52  90.64  85.11  89.05  86.77  87.87  87.57 
YF  92.22  70.50  91.41  70.48  91.38  71.96  89.95  73.30 
Average  90.58  82.60  90.21  83.25  89.47  84.30  88.28  85.18 
True positive (TP) and true negative (TN) rates for reference values of target distance BT when predicted by AF, for E. coli
Set used for  0.105  0.15  0.205  0.25  

training the predictor  TP [%]  TN [%]  TP [%]  TN [%]  TP [%]  TN [%]  TP [%]  TN [%] 
EA  97.00  99.09  96.38  98.78  95.43  98.66  94.61  98.60 
EB  99.08  98.14  98.90  97.43  98.54  96.92  97.97  96.78 
EC  100.00  96.11  99.98  94.75  99.98  93.48  99.96  92.56 
ED  98.67  98.47  98.30  97.93  97.95  97.49  97.49  97.21 
EE  98.31  98.69  97.42  98.39  97.15  97.97  96.57  97.84 
EF  95.46  99.45  94.15  99.35  93.46  99.19  91.43  99.35 
Average  98.09  98.32  97.52  97.77  97.09  97.29  96.34  97.06 
True positive (TP) and True negative (TN) rates for reference values of target distance BT when predicted by AF, for human
Set used for  0.105  0.15  0.205  0.25  

training the predictor  TP [%]  TN [%]  TP [%]  TN [%]  TP [%]  TN [%]  TP [%]  TN [%] 
HA  91.05  82.53  91.24  83.24  90.96  84.74  90.19  86.25 
HB  94.34  78.82  94.34  79.58  93.67  81.78  94.41  81.35 
HC  89.27  84.35  90.15  84.32  88.92  86.24  89.77  86.63 
HD  89.32  84.28  90.17  84.27  89.36  86.24  88.99  87.24 
HE  89.12  84.22  89.57  84.53  89.02  86.37  87.99  87.82 
HF  84.11  85.02  85.47  83.32  84.19  84.04  82.04  85.48 
Average  89.53  83.20  90.16  83.21  89.36  84.90  88.90  85.80 
Figure5 shows that in yeast (panel A) positive precision rate ranges from a percentage of 88.28 (BT = 0.25) until 90.58 (BT = 0.105) while the negative precision rate ranges from 82.60 (BT = 0.105) until 85.18 (BT = 0.25). In E. coli (panel B) both positive and negative precision rates show values always higher than 96.34. In human (panel C) positive precision rate always is around a percentage of 90 and negative precision rate ranges from 83.07 (BT = 0.105) and 85.98 (BT = 0.25).
Tables7,8 and9 show positive, negative, and total precision rates for all the percentiles in the three organisms, revealing, as expected, that for E. coli (Table8) AF has very good performances also in the cross validation (total precision rate is always higher than 0.9), with a slight decreasing slope for the higher percentiles. In human and yeast (Table9 and Table7, respectively), we have globally good performances, with a total precision rate ranging from 0.8 to 0.9.
The results described in Tables7,8 and9 and Figure5 confirm indeed that the AF predictor performs very well also in the cross validation scheme and exhibits good generalization capabilities. The parallel analysis conducted on the other two candidate predictors shows similar performances of BL and much poorer performances of NW (results shown in Additional file1).
Final discussion
The results clearly show the efficacy of the alignmentfree distance in estimating a good readtoread distance measure. The performances of AF in predicting BT are better than NW and at least comparable to BL, but the advantage of using AF is clear: it is linear in the size of the input and has a lower computational time. Indeed, as already discussed in subsection Computational time analysis of the threshold predictors, AF is much faster than NW and BL. As reported above, the prediction power of the three measures depends on the organism we consider, and we believe that this issue deserves further analysis and discussion.
We analyze two eukariotic genomes (yeast and human) and one bacterial one (E. coli); there is evidence that the performances of all the three predictors are globally much better in E. coli. This may be due to the nature of bacterial genomes, which are mostly composed of coding sequences, making easier to recognize overlapping regions and reducing the noise due to low complexity regions present in the intergenic eukariotic portions of genome.
An additional fact that deserves attention is that the distancebased on global alignment (NW), generally performs poorly with respect to the one based on local alignment (BL); the alignmentfree distance (AF) seems to compare well with the local alignment one, despite it is based on the evaluation of the whole sequence, overcoming the bias that may derive from requiring the global alignment of the two reads.
Such a consideration is somehow strengthened by the different performances obtained on reads of different sizes; we recall that reads from human are smaller (average size 75 bases) than yeast and E. coli (100 and 235 bases, respectively); such a difference may explain the improved performances of the NW distance in human, as with shorter reads the advantage of local versus global alignment is reduced.
Conclusions
In this paper, we described and tested a method to compare NGS DNA reads based on an alignmentfree distance. We compared our method with respect to Blast and NeedlemanWunsch algorithms, which rely on an alignmentbased approach. We designed our experiments in order to measure the potential contribution of the method in filtering DNA reads and speed up an assembly process.
We showed that the alignmentfree distance outperformed the two alignedbased ones both in terms of computational time and of prediction performance, and conclude that an alignmentfree distance may be used effectively for read pairs comparison.
In future, we plan to extend the reads comparison with other competitive methods and also with other alignmentfree distances. The results shown in this paper are considered as a starting point to derive more efficient sequence similarity assessments methods for DNA reads obtained from NGS sequencing.
Finally, read pairs comparison based on alignmentfree distances may be conveniently used in future for DNA assembly[34] given its considerable speed, as well as for reads classification[35], e.g., in metagenomics.
Declarations
Acknowledgements
We wish to thank Aleksandra Swiercz for introducing us in Next Generation Sequencing, Raffaele Giancarlo and Alberto Apostolico for sharing their knowledge about alignmentfree algorithms with us.
The authors were partially supported by the Italian PRIN "GenData 2020" (2010RTFWBH), the FLAGSHIP "InterOmics" project (PB.P05), and by the cooperative program between the National Research Council of Italy (CNR) and the Polish Academy of Sciences (PAN).
Authors’ Affiliations
References
 Eisenstein M: The battle for sequencing supremacy. Nat Biotechnol. 2012, 30 (11): 10231026. 10.1038/nbt.2412.PubMedView ArticleGoogle Scholar
 Liu L, Li Y, Li S, Hu N, He Y, Pong R, Lin D, Lu L, Law M: Comparison of nextgeneration sequencing systems. J Biomed Biotechnol. 2012, 251364doi:10.1155/2012/251364Google Scholar
 Metzker ML: Sequencing technologies  the next generation. Nat Rev Genet. 2010, 11 (1): 3146. 10.1038/nrg2626. doi:10.1038/nrg2626PubMedView ArticleGoogle Scholar
 Earl D, Bradnam K, John JS, Darling A, Lin D, Fass J, Yu HOK, Buffalo V, Zerbino DR, Diekhans M, Ariyaratne PN, Sung WK, Ning Z, Haimel M, Simpson JT, Fonseca NA, Birol I, Docking TR, Ho IY, Rokhsar DS, Chikhi R, Lavenier D, Chapuis G, Naquin D, Maillet N, Schatz MC, Kelley DR, Phillippy AM, Koren S, Nguyen N: Assemblathon 1: a competitive assessment of de novo short read assembly methods. Genome Res. 2011, 21 (12): 22242241. 10.1101/gr.126599.111. doi:10.1101/gr.126599.111PubMedPubMed CentralView ArticleGoogle Scholar
 Bradnam KR, Fass JN, Alexandrov A, Baranay P, Bechner M, Birol I, Boisvert S, Chapman JA, Chapuis G, Chikhi R, Chitsaz H, Chou WC, Corbeil J, Fabbro CD, Docking TR, Durbin R, Earl D, Emrich S, Fedotov P, Fonseca NA, Ganapathy G, Gibbs RA, Gnerre S, Godzaridis E, Goldstein S, Haimel M, Hall G, Haussler D, Hiatt JB, Ho IY: Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species. GigaScience. 2013, 2 (1): 131. 10.1186/2047217X21.View ArticleGoogle Scholar
 Nagarajan N, Pop M: Parametric complexity of sequence assembly: theory and applications to next generation sequencing. J Comput Biol. 2009, 16 (7): 897908. 10.1089/cmb.2009.0005. doi:10.1089/cmb.2009.0005PubMedView ArticleGoogle Scholar
 Blazewicz J, Bryja M, Figlerowicz M, Gawron P, Kasprzak M, Kirton E, Platt D, Przybytek J, Swiercz A, Szajkowski L: Whole genome assembly from 454 sequencing output via modified dna graph concept. Comput Biol Chem. 2009, 33 (3): 224230. 10.1016/j.compbiolchem.2009.04.005. doi:10.1016/j.compbiolchem.2009.04.005PubMedView ArticleGoogle Scholar
 Compeau PEC, Pevzner PA, Tesler G: How to apply de bruijn graphs to genome assembly. Nat Biotechnol. 2011, 29 (11): 987991. 10.1038/nbt.2023. doi:10.1038/nbt.2023PubMedView ArticleGoogle Scholar
 Birol I, Jackman SD, Nielsen CB, Qian JQ, Varhol R, Stazyk G, Morin RD, Zhao Y, Hirst M, Schein JE, Horsman DE, Connors JM, Gascoyne RD, Marra MA, Jones SJ: De novo transcriptome assembly with abyss. Bioinformatics. 2009, 25 (21): 28722877. 10.1093/bioinformatics/btp367.PubMedView ArticleGoogle Scholar
 Zerbino DR, Birney E: Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Res. 2008, 18 (5): 821829. 10.1101/gr.074492.107.PubMedPubMed CentralView ArticleGoogle Scholar
 Luo R, Liu B, Xie Y, Li Z, Huang W, Yuan J, He G, Chen Y, Pan Q, Liu Y, Tang J, Wu G, Zhang H, Shi Y, Liu Y, Yu C, Wang B, Lu Y, Han C, Cheung DW, Yiu SM, Peng S, Xiaoqian Z, Liu G, Liao X, Li Y, Yang H, Wang J, Lam TW, Wang J: Soapdenovo2: an empirically improved memoryefficient shortread de novo assembler. Gigascience. 2012, 1 (1): 1810.1186/2047217X118.PubMedPubMed CentralView ArticleGoogle Scholar
 Miller JR, Koren S, Sutton G: Assembly algorithms for nextgeneration sequencing data. Genomics. 2010, 95 (6): 315327. 10.1016/j.ygeno.2010.03.001.PubMedPubMed CentralView ArticleGoogle Scholar
 Vinga S, Almeida J: Alignmentfree sequence comparisona review. Bioinformatics. 2003, 19 (4): 513523. 10.1093/bioinformatics/btg005.PubMedView ArticleGoogle Scholar
 Polychronopoulos D, Weitschek E, Dimitrieva S, Bucher P, Felici G, Almirantis Y: Classification of selectively constrained dna elements using feature vectors and rulebased classifiers. Genomics. 2014, 104 (2): 7986. 10.1016/j.ygeno.2014.07.004.PubMedView ArticleGoogle Scholar
 Li M, Vitnyi PMB: An Introduction to Kolmogorov Complexity and Its Applications. 2008, New York, NY, USA: SpringerView ArticleGoogle Scholar
 Almeida JS, Vinga S: Universal sequence map (usm) of arbitrary discrete sequences. BMC Bioinf. 2002, 3: 610.1186/1471210536.View ArticleGoogle Scholar
 Giancarlo R, Scaturro D, Utro F: Textual data compression in computational biology: a synopsis. Bioinformatics. 2009, 25 (13): 15751586. 10.1093/bioinformatics/btp117.PubMedView ArticleGoogle Scholar
 Kuksa P, Pavlovic V: Efficient alignmentfree dna barcode analytics. BMC Bioinf. 2009, 10 (Suppl 14): 910.1186/1471210510S14S9. doi:10.1186/1471210510S14S9View ArticleGoogle Scholar
 Hide W, Burke J, Da Vison DB: Biological evaluation of d2, an algorithm for highperformance sequence comparison. J Comput Biol. 1994, 1 (3): 199215. 10.1089/cmb.1994.1.199.PubMedView ArticleGoogle Scholar
 Teeling H, Meyerdiekers A, Bauer M, Glöckner FO: Application of tetranucleotide frequencies for the assignment of genomic fragments. Environ Microbiol. 2004, 6 (9): 938947. 10.1111/j.14622920.2004.00624.x.PubMedView ArticleGoogle Scholar
 Pride DT, Meinersmann RJ, Wassenaar TM, Blaser MJ: Evolutionary implications of microbial genome tetranucleotide frequency biases. Genome Res. 2003, 13: 145158. 10.1101/gr.335003.PubMedPubMed CentralView ArticleGoogle Scholar
 Teeling H, Waldmann J, Lombardot T, Bauer M, Glöckner FO: Tetra: a webservice and a standalone program for the analysis and comparison of tetranucleotide usage patterns in dna sequences. BMC Bioinf. 2004, 5: 16310.1186/147121055163.View ArticleGoogle Scholar
 Langmead B, Trapnell C, Pop M, Salzberg SL: Ultrafast and memoryefficient alignment of short dna sequences to the human genome. Genome Biol. 2009, 10 (3): 2510.1186/gb2009103r25.View ArticleGoogle Scholar
 Langmead B, Salzberg SL: Fast gappedread alignment with bowtie 2. Nat Methods. 2012, 9 (4): 357359. 10.1038/nmeth.1923.PubMedPubMed CentralView ArticleGoogle Scholar
 Needleman SB, Wunsch CD: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol. 1970, 48 (3): 443453. 10.1016/00222836(70)900574.PubMedView ArticleGoogle Scholar
 NeoBio: Bioinformatics Algorithms in Java. [http://neobio.sourceforge.net/],
 Altschul S, Gish W, Miller W, Myers E, Lipman D: Basic local alignment search tool. J Mol Biol. 1990, 215: 403410. 10.1016/S00222836(05)803602.PubMedView ArticleGoogle Scholar
 Blast Package Version 2.2.257.http://packages.ubuntu.com/precise/ncbiblast+,
 Fawcett T: An introduction to roc analysis. Pattern Recognit Lett. 2006, 27: 861874. 10.1016/j.patrec.2005.10.010.View ArticleGoogle Scholar
 NCBI Sequence Read Archive.http://www.ncbi.nlm.nih.gov/sra,
 E. Coli Reads Source.http://petang.cgu.edu.tw/Bioinfomatics/Lecture/0_HTS/08/HTS_E08.pdf,
 Yeast Bowtie Index.http://ftp.ccb.jhu.edu/pub/data/bowtie_indexes/s_cerevisiae.ebwt.zip,
 E. Coli Bowtie Index.http://ftp.ccb.jhu.edu/pub/data/bowtie_indexes/e_coli.ebwt.zip,
 Dazzler Assembler for PacBio Reads.http://www.homolog.us/blogs/blog/2014/02/14/dazzleassemblerpacbioreadsgenemyers/,
 Song K, Ren J, Zhai Z, Liu X, Deng M, Sun F: Alignmentfree sequence comparison based on next generation sequencing reads. J Comput Biol. 2013, 20 (2): 6479. 10.1089/cmb.2012.0228.PubMedPubMed CentralView ArticleGoogle Scholar
Copyright
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/4.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.