- Methodology article
- Open Access
- Published:

# CNV-TV: A robust method to discover copy number variation from short sequencing reads

*BMC Bioinformatics*
**volume 14**, Article number: 150 (2013)

## Abstract

### Background

Copy number variation (CNV) is an important structural variation (SV) in human genome. Various studies have shown that CNVs are associated with complex diseases. Traditional CNV detection methods such as fluorescence *in situ* hybridization (FISH) and array comparative genomic hybridization (aCGH) suffer from low resolution. The next generation sequencing (NGS) technique promises a higher resolution detection of CNVs and several methods were recently proposed for realizing such a promise. However, the performances of these methods are not robust under some conditions, *e.g.*, some of them may fail to detect CNVs of short sizes. There has been a strong demand for reliable detection of CNVs from high resolution NGS data.

### Results

A novel and robust method to detect CNV from short sequencing reads is proposed in this study. The detection of CNV is modeled as a change-point detection from the read depth (RD) signal derived from the NGS, which is fitted with a total variation (TV) penalized least squares model. The performance (*e.g.*, sensitivity and specificity) of the proposed approach are evaluated by comparison with several recently published methods on both simulated and real data from the 1000 Genomes Project.

### Conclusion

The experimental results showed that both the true positive rate and false positive rate of the proposed detection method do not change significantly for CNVs with different copy numbers and lengthes, when compared with several existing methods. Therefore, our proposed approach results in a more reliable detection of CNVs than the existing methods.

## Background

Copy number variation (CNV) [1] has been discovered widely in human and other mammal genomes. It was reported that CNVs are present in human populations with high frequency (more than 10 percent) [2]. Various studies showed that CNVs are associated with Mendelian diseases or complex diseases such as autism [3], schizophrenia [4], cancer [5], Alzheimer disease [6], osteoporosis [7], *etc.*

CNV is commonly referred to as a type of structural variations (SVs), and involves a duplication or deletion of DNA segment of size more than 1 kbp [8]. The mechanism by which CNVs convey with phenotypes is still under study. A widely accepted explanation is that, if a CNV region harbors a dosage-sensitive segment, the gene expression level varies, which leads to the abnormality of related phenotype consequently [9].

Before the emergence of next generation sequencing (NGS) technologies, methods such as fluorescence *in situ* hybridization (FISH) and array comparative genomic hybridization (aCGH) were employed to detect CNVs. The main problem of these methods is their relatively low resolutions (about 5 ∼10 Mbp for FISH, and 10 ∼25 kbp with 1 million probes for aCGH [10]). With the rapid decrease of the cost of NGS, high coverage sequencing became feasible, offering high resolution CNV detection. After Korbel *et al.*’s work of detecting CNVs from NGS data [11, 12], many CNV detection methods have been developed recently [10, 13-23]. However, as shown in our previous study [24], the performances of the existing methods are not robust; *e*.g., CNVnator degenerates at small single copy length; and readDepth degenerates at low copy number variation (see the simulation). So new methods are needed for reliable detection of CNVs.

Methodologically, there are mainly two ways to detect CNVs from NGS data [25]: pair-end mapping (PEM) and depth of coverage (DOC) based methods. The PEM based method is commonly used to detect insertion, deletion, inversion, *etc.*[26]. After the pair ends from the test genome being aligned to the reference genome, the span between the pair ends of the test genome is compared with that of the reference genome. The significant difference between the two spans implies the presence of a deletion or insertion event. There are several DOC based methods, such as CNV-seq [14], FREEC [20], readDepth [21], CNVnator [22], SegSeq [13], and event-wise testing (EWT) [10]. The principle of DOC based methods is: the short reads are randomly sampled on the genome, so when the short reads are aligned to the reference genome, the density of the short reads is locally proportional to the copy number [10]. Based on the probability distribution of the read depth (RD) signal, a statistical hypothesis testing will tell whether a CNV exists or not. Specifically, the procedure of DOC based methods include: aligned reads are first piled up and then the read counts are calculated across a sliding [14] or non-overlapping windows (or bins) [10, 13, 20, 22], yielding the so-called RD signal. The ratio of the read counts (case *vs.* matched control) is used by CNV-seq [14] and SegSeq [13], so further normalization is not required [18]. Otherwise, normalization such as GC-content [10, 22] and mapability [21] correction is required. The normalized read depth signal (or the raio) is analyzed with either of the following procedures: (1) segmented or partitioned by change-point detection algorithms, and followed with a merge procedure [13] (*e.g.* readDepth [21] and CNVnator [22] utilize circular binary segmentation (CBS) and mean shift, respectively). (2) tested by a statistical hypothesis at each window (*e.g.*, event-wise testing (EWT) [10]) or several consecutive windows (*e.g.*, CNV-seq [14]).

We propose a total variation (TV) penalized least squares model to fit the RD signal, based on which the CNVs are detected with a statistical testing. We name the method as the CNV-TV. CNV-TV assumes that a plateau/basin in the RD signal correspond to a duplication/deletion event (*i.e.*, CNV). Then a piecewise constant function is used to fit the RD signal with the TV penalized least squares, from which the CNVs are detected. It is often cumbersome to determine the tuning of the penalty parameter in the model, which controls the tradeoff between sensitivity and specificity. Therefore, the Schwarz information criterion (SIC) [27] is introduced to find the optimal parameter. The proposed method may be applied either to paired data (tumor *v.s.* control in oncogenomic research) or to single sample that has been adjusted for technical factors such as GC-content bias. The key feature of the CNV-TV method is its robust performance, *i.e.,* the detection sensitivity and specificity keeps stable when detecting CNVs with short length or near-normal copy number. Compared with several recently published CNV detection methods on both simulated and real data, the results show that CNV-TV can provide more robust and reliable detection of CNVs.

## Methods

The first step to process the raw NGS data is to align (or map) the short reads with a reference genome (or template, NCBI37/hg19, for example) by alignment tools such as MAQ [28] and Bowtie [29]. Then the aligned reads are piled up, and read depth signal *y*_{
i
},(*i*=1,2,…,*n*) is calculated to measure the density of the aligned reads, where *n* is the length of the read depth signal. There are several ways to calculate *y*_{
i
}, for example, Yoon *et al.*[10] used the count of aligned reads that fall in a non-overlapping window with size 100 bp, while Xie and Tammi [14] used a sliding window with 50% overlap.

The detection of CNVs from read depth signal *y*_{
i
} can be viewed as a change-point detection problem (see Figure 1 where *y*_{
i
}’s are the black dots). There exist many methods to address this problem [30]. The total variation (TV) based regularization method has been widely used in the signal processing community to remove noise from signals [31]. In this paper, we use the total variation penalized least squares as shown in Eq. (1) to fit the RD profile, based on which a statistical test is used to detect CNVs.

In Eq. (1), the first term is the fitting error between *y*_{
i
} and the recovered smooth signal *x*_{
i
}; the second term is the total variation penalty: when a change-point presents between *x*_{
i
} and *x*_{i+1}, a penalty *ϕ*(*x*_{i+1}−*x*_{
i
}) is imposed. The penalty function *ϕ*(*x*) is usually a symmetric function that is null at the origin and monotonically increases for positive *x*. The ideal choice of *ϕ*(*x*) is the *ℓ*-0 norm of *x*. However the *ℓ*-0 norm yields an NP-hard problem, which is computationally prohibitive. Instead, convex or non-convex relaxations of *ℓ*-0 norm are of greater interest, such as Huber function [32], truncated quadratic [33]*etc.* In recent compressed sensing theory [34, 35], *ℓ*-1 norm penalized models [36] received wide attention because of their robust performance, as well as the availability of fast algorithms such as the homotopy [37, 38] and least angle regression (LARS) [39]. For these reasons, we select the *ℓ*-1 norm as the penalty function *ϕ*(*x*).

*λ* is the penalty parameter, which controls the tradeoff between the fitting fidelity (or fitting error) and penalty caused by the change-points. When *λ*→0, the effect of penalty term is ignorable and the solution is *x*_{
i
}=*y*_{
i
}. On the contrary, when *λ*→+*∞*, the effect of fitting fidelity term is ignorable and the solution is ${x}_{1}={x}_{2}=\dots ={x}_{n}={\stackrel{\u0304}{y}}_{i}$, indicating that there is no change-point (here ${\stackrel{\u0304}{y}}_{i}$ is the mean of *y*_{
i
}). As a result, when *λ* decreases from +*∞* to 0, the change-points can be detected one by one according to their significance level. The notation *x*_{
i
}(*λ*),(*i*=1,2,…,*n*), which characterizes the evolution of solution *x*_{
i
} with respect to *λ*, is termed as the set of solutions.

To simplify notations in Eq. (1) for further presentation, ** y** and

**are introduced as the the vector forms of**

*x**y*

_{ i }and

*x*

_{ i }respectively,

*i.e.*

**=[**

*y**y*

_{1},

*y*

_{2},…,

*y*

_{ n }]

^{T}, and

**=[**

*x**x*

_{1},

*x*

_{2},…,

*x*

_{ n }]

^{T}, where

*T*represents the transpose operation. Therefore, the matrix form of Eq. (1) reads:

where ∥·∥^{2} is the sum of squares of a vector; ∥·∥_{1} denotes the *ℓ*-1 norm, *i.e.* the sum of absolute values of each entry in a vector; and ** D** is a matrix of size (

*n*−1)×

*n*that calculates the first order derivatives of signal

**(note that the first entry of**

*x***is**

*Dx**x*

_{2}−

*x*

_{1}, the second is

*x*

_{3}−

*x*

_{2},

*etc.*):

Harchaoui and Lévy-Leduc [40] proposed to use the LASSO [41] to solve an alternative form of Eq. (2). In [42] we presented an algorithm to estimate directly the set of solutions of Eq. (2). In fact, Eq. (2) is equivalent to the following problem [43]:

where

Eq. (4) is the *ℓ*-1 norm based regression, and thus can be solved efficiently using algorithms like homotopy [37, 38] and least angle regression (LARS) [39]. Once ** u** is known,

**can be obtained as [44]**

*x*As mentioned previously, both the robust performance and the availability of efficient numerical algorithms are our considerations for choosing the *ℓ*-1 norm based penalization. Another attracting property of *ℓ*-1 norm is that it yields sparse solution [45], *i.e.,* ** u** is a sparse vector with a limited number of non-zero values. Consequently,

**, the first order integral of**

*x***, is a piece-wise constant signal, which is our basic assumption about the read depth signal.**

*u*If the set of solutions {*x*_{
i
}(*λ*_{
k
})|*i*=1,2,…,*n*;*k*=1,2,…,*K*} of Eq. (2) is known, change-points can be sorted according to their significance by tuning *λ* from *λ*_{1}=+*∞* to *λ*_{
K
}=0. Here *K* is the number of transition points of the solution when *λ* decreases from +*∞* to 0 [46], which can be estimated by a LASSO solver.

A user can make the final decision on which *λ* to use. However, an automatic approach to choose this parameter is desirable. In the following, the model selection technique is employed to address this problem. In our problem, the degree of the model is the number of pieces in the smoothed read depth signal *x*_{
i
}, or the number of change-points plus one. A few commonly used model selection methods include *L*-curve [47], Akaike information criterion [48], Schwarz information criterion (SIC) [27], *etc.* Here, the SIC is adopted because of its robust performance [49], and has been used in our earlier study for detecting CNVs from aCGH data [50].

Since the *ℓ*-1 norm based solution is biased [51], a correction is needed first. For solutions *x*_{
i
}(*λ*_{
k
})^{′}*s*,(*i*=1,2,…,*n*) at *λ*_{
k
}, first they are segmented into pieces such that within the piece $\mathcal{I}=\{i,i+1,\dots \phantom{\rule{0.3em}{0ex}}i+l\}$, *x*_{
i
}=*x*_{i+1}=…=*x*_{i+l} (here we omit the dependency on *λ*_{
k
}), and at change-points *x*_{i−1}≠*x*_{
i
},*x*_{i+l}≠*x*_{i+l+1}. Then the correction is carried out piece by piece. For each piece $\mathcal{I}$, the mean of *y*_{
i
} within this piece is used as the amplitude of *x*_{
i
}, *i.e.*, ${\stackrel{~}{x}}_{i}={\stackrel{~}{x}}_{i+1}=\dots ={\stackrel{~}{x}}_{i+l}=\frac{\sum _{i}^{i+l}{y}_{i}}{l+1}$ (see Figure 1, where *x*_{
i
} is the blue line and ${\stackrel{~}{x}}_{i}$ is the red one). The SIC at *λ*_{
k
} is calculated as:

where *m* is the number of pieces, and *σ*^{2} is the variance of noise, which can be estimated manually from the region that does not harbor any CNV. The optimal *λ* is achieved at (see Figure 2):

Once $\widehat{\lambda}$ is known, the optimal smooth signal of *y*_{
i
} is ${\stackrel{~}{x}}_{i}\left(\widehat{\lambda}\right)$; then a CNV can be identified as a segment with significantly abnormal amplitude, *i.e.* the amplitude below or above some predefined cutoff values. This cutoff values can either be estimated from the noise variance, or be estimated adaptively from the histogram of the read depth signal since the distribution of the read depth signal can be modeled as a mixture of Poisson distributions [52]. After the region of CNV is estimated, the copy number value can be estimated as the ratio between the reads count of the CNV region in the test genome and that of the corresponding region in the reference or control genome.

## Results

We evaluated the proposed method on both simulated and real data, and compared the results with six representative CNV detection methods.

A number of CNV detection methods have been published recently for NGS data analysis [10, 13-23], and these methods are different in the use of statistical model, parameter, methodology, programming language, operating system, input requirement, output format, *etc.*; a comparative study of these different methods has been conducted by us [24]. Based on these factors, as well as the availability and the citation of these methods in literatures, six popular and representative methods were selected: CNV-seq [14], FREEC [20], readDepth [21], CNVnator [22], SegSeq [13], and event-wise testing (EWT) [10].

The parameters of selected CNV detection methods were tuned to achieve their best performances in the sense that their sensitivities are maximized while the false positive rates are controlled below 1e-3. The criteria of tuning the parameters are given as follows: (1) the shared parameters are set the same for fairness. For example, the thresholds for CNV-seq and FREEC are set to 0.6; the *p*-values of CNV-seq, *P*_{
i
n
i
t
} and *P*_{
m
e
r
g
e
} of SegSeq, false detection rate of readDepth are set to 1e-3; the bin size of CNVnator is set to 100 bp since the recommended bin size of GC-content correction is 100 bp for both readDepth and EWT. The smallest *H*_{
b
} parameter (number of consecutive bins) of CNVnator is 8, so the ‘filter’ parameter of EWT is also set to 8. With this parameter, the smallest detectable CNV has the length of 800 bp, so the window size of FREEC and SegSeq is set to 800 bp. (2) The unique parameter of each method is tested after the shared parameters are fixed. In summary, the parameters are as follows: for CNV-seq, ‘p-value’ is set to 1e-3, and ‘log2-threshold’ is set 0.6; the ‘bin_size’ of CNVnator is set to 100 bp. For readDepth, ‘fdr’ is set to 1e-3; ‘overDispersion’ is set to 1; ‘readLength’ is set to 36 bp; ‘percCNGain’ and ‘percCNLoss’ are set to 0.01; ’chunkSize’ is set to 5e6. For EWT, the bin size ‘win’ is set to 100 bp; and ‘filter’ is set to 8. For SegSeq, the window size is set to 800 bp; the break-point *p*-value ‘p_bkp’ and merge *p*-value ‘p_merge’ are set to 1e-3. For FREEC, ‘window’ is set to 800 bp; ‘step’ is set to 400 bp; and the threshold is set to 0.6. Parameters not mentioned here are set to default.

For CNV-TV, the read depth signal was calculated from the BAM file with SAMtools [53], with the window size of 100 bp. The GC-content bias [54] was corrected using the profile file of RDXplorer [10]. The corrected read depth signal was then segmented by the proposed method. The matlab function *SolveLasso* from the SparseLab package (http://sparselab.stanford.edu/) was used to estimate the set of solutions of Problem (4). The noise variance *σ* in Eq. 7 was calculated as the median of the standard deviations of 10 segments with length 10 kbp, which are evenly distributed on the whole chromosome. The cutoff value to call a CNV was determined by the histogram of the corrected read depth signal, such that both the left and right tail areas cover five percent of the whole distribution.

### Simulated data processing

To test the performance of CNV-TV comprehensively for a set of conditions (copy number *c* and single copy length *l*), simulations were carried out. 1000 Monte Carlo trials were run repeatedly for each condition. In the first experiment, the effect of single copy length (the length of red block in Figure 3) was tested, which changes from 1 kbp to 6 kbp. In the second experiment, the effect of copy number (the number of red block in Figure 3) was tested, which varies from 0 to 6. The coverage is fixed to 5.

The procedure of each Monte Carlo trial is as follows: (1) All the reported variations of chromosome 1 and 21 of NCBI36/hg18 were removed, and 10 sequences of length 1 Mbp were extracted. Here, the removed CNVs were retrieved from the database of genomic variants (DGV, http://projects.tcag.ca/variation/), including all the discovered CNVs reported in the literature. Then, a sequence was selected randomly among the 10, and was concatenated with its duplication, yielding the reference genome of length 2 Mbp. This reference genome was also used as the control genome. Since we only introduce one CNV in each genome for efficient comparison, a genome of 2 Mbp is large enough. (2) A CNV with copy number *c* and single copy length *l* was introduced artificially to generate the test genome (see Figure 3, where the copy number varies from 2 to 4). Copy number 2 is assumed to be normal; copy number smaller than 2 (0 and 1) indicates deletion event; and copy number larger than 2 (3 and 6) indicates duplication event. (3) SNPs and indels were introduced. The frequency is 5 SNPs/kbp and 0.5 indels/kbp respectively, and the indels have random length of 1 ∼3 bp. (4) Short reads were sampled on both control and test genome to simulate the short-gun sequencing. In such a case, read counts follow the Poisson distribution with the density parameter proportional to the copy number. To simulate the non-uniform bias, the reads were sampled with a sample probability *p*, which is the product of mapability and GC-content profile. Each read has the length of 36 bp to agree with the Illumina platform. We note that, all the studies in the paper used the data that simulate the Illumina platform but the proposed method can be applied to other NGS platforms with longer read length. (5) The short reads were aligned to the reference genome by using Bowtie [29]. Since a read may align to multiple loci, there are mainly two ways to handle this issue: one way is to report only the uniquely mapped read [13], while the other is to select randomly one among the multiple aligments [22]. These two ways have been discussed in [28, 29, 55]. In this work, the default setting of Bowtie (similar to MAQ’s default policy [29]) is used such that best alignments with less mismatches are reported. When a read has multiple alignments with the same quality score, a random locus is assigned. (6) Finally, CNV-TV and other CNV detection methods were called. Their outputs, *i.e.*, estimates of both change-point position and copy number, were compared with the ground truth (*i.e.,*parameters used in introducing CNVs into the test genome in Step (2)).

The false positive rate (FPR, equivalent to 1-specificity) *v.s.* true positive rate (TPR, or sensitivity) of these detection methods are listed in Tables 1 and 2. The FPR is defined as the ratio between the number of false detected CNV loci and that of ground truth normal loci, in the unit of base pair; the TPR is defined as the ratio between the number of true detected CNV loci and that of ground truth CNV loci. The box plots (which includes the minimum, the lower quartile, the median, the upper quartile and the maximum) of the estimates of both the break point locus and copy number are displayed in Figures 4 and 5; the means and standard deviations of the estimation errors are shown in Additional file 1: Tables S1 and S2 respectively. Since CNV-seq, FREEC and SegSeq need control samples, while readDepth, CNVnator and EWT do not, they are displayed in two groups respectively. Correspondingly, ‘CNV-TV1’ indicates the test-control setting, in which the input *x*_{
i
} is the read depth signal ratio between the test and the control sample; ‘CNV-TV2’ indicates the test-only setting. We found that the methods to be compared fail occasionally; for example, CNVnator degenerates when the length of CNV is small (see Table 1); readDepth and CNV-seq fail when the copy number is close to the normal one (*c*=2, see Table 2). However, it can be seen that there are little changes on the estimates with CNV-TV with respect to both the single copy length *l* and the copy number *c*, indicating more robust performance of CNV-TV than that of other methods.

### Real data processing

To demonstrate the performance of CNV-TV with real data, and compare the quality of detected CNVs with other methods, mapped reads data (BAM files) were downloaded from the 1000 Genomes Project at http://ftp.1000genomes.ebi.ac.uk/. The reads were sequenced from the chromosome 21 of NA19240 (yoruba female) with SLX, Illumina Genome Analyzer. There are 33.4 million reads uniquely aligned to NCBI36/hg18.

Figure 6 shows the read depth signal (blue line) as well as the detected CNV regions (red dots below), and the enlarged view of the region 37.0 ∼37.1 Mbp (region within the two vertical magenta lines) is displayed in Figure 1. The overlaps of CNVs detected by the CNV-TV, and other six methods, as well as those listed in DGV [2], were displayed by an 8-way Venn diagram, whose unit is a block of size 100 bp. Since the 8-way Venn diagram is too complicated to visualize (there are totally 2^{8}−1=255 domains), it is tabularized in a binary manner, as shown in Table 3, which only lists the domains with block number greater than 1000. For example, the first column means that there are 31144 blocks that are uniquely detected by SegSeq but are not detected by any other methods or in DGV. Here we used the beta version of DGV, where CNVs can be retrieved by sample, platform, study, *etc.* The option of filter query was ‘external sample id = NA19240, chromosome = 21, assembly = NCBI36/hg18, variant type = CNV’. Table 3 shows that most of the CNVs detected by CNV-TV are consistent with other methods, demonstrating the robustness and reliability of our proposed method. Nevertheless, CNV-TV also reported a small amount of uniquely detected CNVs with length around 1 kbp, *e.g.*, the region at 37.04 Mbp in Figure 1.

The *F*-score [56] measures the overlap quality between two sections. It takes values between 0 and 1. A low score indicates poor quality overlap while a high score indicates good quality overlap. The *F*-score is calculated as $F=2\frac{\mathit{\text{PR}}}{P+R}$, where *P* is the precision (percent of detected CNVs that overlap with the ground truth CNVs from DGV) and *R* is the recall (percent of the ground truth CNVs which overlap with the detected CNVs). Table 4 lists the top 10 *F*-scores of each method, and the corresponding *P* and *R* are listed in the Additional file 1 (Tables S3 and S4). It can be seen that the CNV-TV method can provide CNVs with higher *F*-scores, indicating better quality compared with other methods.

Five more sequence data were also processed, which were sampled from chromosome 21 of a CEU trio of European ancestry: NA12878 the daughter, NA12891 the father and NA12892 the mother, a Yoruba Nigerian female NA19238, and a male NA19239. The 8-way Venn diagram analysis shows that on average 98.7% of CNVs detected by the CNV-TV overlap with at least one CNV by other method, or DGV. This number for CNV-seq is 97.8%, FREEC 97.1%, readDepth 89.5%, CNVnator 85.2%, SegSeq 22.4%, EWT 78.3%, respectively.

Table 5 summarizes the average distributions of *F*-score of the detected CNVs of each method over the six sequence data. Each detected CNV is cataloged into 10 classes (0∼0.1,0.1∼0.2,…,0.9∼1) according to its *F*-score. It is shown that the CNV-TV reports less low quality detections (*F*-score is lower than 0.1) and more high quality detections (*F*-score is greater than 0.5), indicating its robust performance.

The experiments were carried out on a desktop computer with a dual-core 2.8 GHz x86 64 bit processor, 6 GB memory and openSUSE 11.3. CNV-TV finished the processing in 112.2 seconds with peak memory usage of 383.4 Mega bytes. The computation time and memory usage of CNV-seq, FREEC, readDepth, CNVnator, SegSeq and EWT are 251.5, 319.6, 134.8, 162.6, 248.8 and 268.9 seconds, 27.1, 7.1, 1060.1, 101.9, 3508.4, and 156.6 Mega bytes, respectively. This shows that the CNV-TV is the fastest in computation with reasonable memory usage.

## Conclusion and discussion

In this paper, we proposed the CNV-TV method based on total variation penalized least squares optimization, in order to detect copy number variation from next generation sequencing data. The proposed method assumes that the read depth signal is piecewise constant, and the plateaus and basins of the read depth signal correspond to duplications and deletions respectively. Here three major points should be highlighted: (1) The proposed CNV-TV method is quite automatic. We use the SIC to determine the tuning of the penalty parameter for the control of the tradeoff between TPR and FPR, which is often cumbersome to do. (2) The method can be applied to either matched pair data or single data adjusted for technical factors such as the GC-content correction. (3) The method has better robustness, more reliability, and higher detection resolution. We compared the CNV-TV method with six other CNV detection methods. The simulation studies show that the detection performance of CNV-TV in terms of break point position and copy number estimation are more robust compared with six other methods under a set of parameters (*e.g.*, different single copy lengths and copy numbers). The test on real data processing demonstrates that CNV-TV gives higher resolution to detect CNVs of smaller size. In addition, the method can detect CNVs with higher *F*-scores, showing better quality compared with other methods.

The simulation results (Tables 1, 2, Additional file 1: Tables S1, and S2) show that CNV-TV gives slightly lower FPR and estimation error than those of FREEC when the single copy length is 6 kbp, and the copy number is 0. Real data processing results (Tables 4 and 5) indicate that CNV-TV can detect CNVs with higher *F*-score compared with FREEC. However, both simulation and real data processing results show that the overall performances of FREEC and CNV-TV are similar. Since both of them formulate the CNV detection problem as a change-point detection based on sparse representation, and use the LASSO to solve the problem. Therefore it is worthwhile to show their differences and connections. The first is that the two methods use different models. FREEC uses the method proposed by Harchaoui and Lévy-Leduc [40], in which the matrix ** A** in Eq. (4) is an

*n*×

*n*lower triangular matrix with nonzero elements equal to one; in our CNV-TV method, the

**matrix is an**

*A**n*×(

*n*−1) triangular matrix. These two matrices are closely related, but with the difference up to a projection procedure implied in Eq. (5). The second lies in the method to determine the number of change-points. FREEC uses the LASSO to select a set of candidate change-points, and the number of the change points is up-bounded by a predefined value

*K*

_{ m a x }. Then it uses the reduced dynamic programming (rDP) to determine the best number of change-points among the candidates. CNV-TV uses the SIC to determine the number of change-points, which takes the complexity of the model into account. The computational complexity of rDP and SIC are $\mathcal{O}\left({K}_{\mathit{\text{max}}}^{3}\right)$ and $\mathcal{O}\left({K}_{\mathit{\text{max}}}\right)$ respectively. When

*K*

_{ m a x }is large, especially being true for whole genomic data analysis, CNV-TV can save computation significantly.

Our proposed CNV-TV is based on DOC profile and therefore we make the comparison currently with those methods also based on DOC. Because large events can be detected with DOC profile while small events can be detected with PEM signature, these two signatures provide complementary information. A good strategy is to combine these two signatures as described in methods [16, 17, 57]. These methods use the DOC signature to detect the coarse region of CNV, and then estimate the fine locus of the break points with PEM signature. In addition, the analysis of tandem duplication regions is also challenging since one read may have multiple alignment loci. A simple way to alleviate this issue is to randomly assign a locus. Another way is to increase the read length, which can decrease the frequency of multiple alignment. He *et al.*[58] proposed to use the discordant read pairs and unmapped reads that span on the break points to detect CNVs, and the precision of detected CNV break points can reach at base pair level. So our future work will consider the incorporation of multiple signatures into algorithm design, which could further improve CNV detection accuracy.

## References

- 1.
Redon R: Global variation in copy number in the human genome. Nature. 2006, 444 (7118): 444-454. 10.1038/nature05329.

- 2.
Iafrate AJ, Feuk L, Rivera MN, Listewnik ML, Donahoe PK, Qi Y, Scherer SW, Lee C: Detection of large-scale variation in the human genome. Nat Genet. 2004, 36 (9): 949-951. 10.1038/ng1416.

- 3.
Sebat J, Lakshmi B, Malhotra D, Troge J, Lese-Martin C, Walsh T, Yamrom B, Yoon S, Krasnitz A, Kendall J, Leotta A, Pai D, Zhang R, Lee YH, Hicks J, Spence SJ, Lee AT, Puura K, Lehtimäki T, Ledbetter D, Gregersen PK, Bregman J, Sutcliffe JS, Jobanputra V, Chung W, Warburton D, King MC, Skuse D, Geschwind DH, Gilliam TC, Ye K, Wigler M: Strong association of de novo copy number mutations with autism. Science. 2007, 316: 445-449. 10.1126/science.1138659.

- 4.
Stefansson H: Large recurrent microdeletions associated with schizophrenia. Nature. 2008, 455: 232-236. 10.1038/nature07229.

- 5.
Campbell PJ, Stephens PJ, Pleasance ED, O’Meara S, Li H, Santarius T, Stebbings LA, Leroy C, Edkins S, Hardy C, Teague JW, Menzies A, Goodhead I, Turner DJ, Clee CM, Quail MA, Cox A, Brown C, Durbin R, Hurles ME, Edwards PAW, Bignell GR, Stratton MR, Futreal PA: Identification of somatically acquired rearrangements in cancer using genome-wide massively parallel paired-end sequencing. Nat Genet. 2008, 40: 722-729. 10.1038/ng.128.

- 6.
Rovelet-Lecrux A, Hannequin D, Raux G, Meur NL, Laquerrière A, Vital A, Dumanchin C, Feuillette S, Brice A, Vercelletto M, Dubas F, Frebourg T, Campion D: APP locus duplication causes autosomal dominant early-onset Alzheimer disease with cerebral amyloid angiopathy. Nat Genet. 2006, 38: 24-26. 10.1038/ng1718.

- 7.
Yang TL, Chen XD, Guo Y, Lei SF, Wang JT, Zhou Q, Pan F, Chen Y, Zhang ZX, Dong SS, Xu XH, Yan H, Liu X, Qiu C, Zhu XZ, Chen T, Li M, Zhang H, Zhang L, Drees BM, Hamilton JJ, Papasian CJ, Recker RR, Song XP, Cheng J, Deng HW: Genome-wide copy-number-variation study identified a susceptibility gene, UGT2B17, for osteoporosis. Am J Hum Genet. 2008, 83 (6): 663-674. 10.1016/j.ajhg.2008.10.006.

- 8.
Freeman JL, Perry GH, Feuk L, Redon R, McCarroll SA, Altshuler DM, Aburatani H, Jones KW, Tyler-Smith C, Hurles ME, Carter NP, Scherer SW, Lee C: Copy number variation: new insights in genome diversity. Genome Res. 2006, 16: 949-961. 10.1101/gr.3677206.

- 9.
Stankiewicz P, Lupski JR: Structural variation in the human genome and its role in disease. Annu Rev Med. 2010, 61: 437-455. 10.1146/annurev-med-100708-204735.

- 10.
Yoon S, Xuan Z, Makarov V, Ye K, Sebat J: Sensitive and accurate detection of copy number variants using read depth of coverage. Genome Res. 2009, 19: 1586-1592. 10.1101/gr.092981.109.

- 11.
Korbel JO, Urban AE, Affourtit JP, Godwin B, Grubert F, Simons JF, Kim PM, Palejev D, Carriero NJ, Du L, Taillon BE, Chen Z, Tanzer A, Saunders ACE, Chi J, Yang F, Carter NP, Hurles ME, Weissman SM, Harkins TT, Gerstein MB, Egholm M, Snyder M: Paired-end mapping reveals extensive structural variation in the human genome. Science. 2007, 318: 420-426. 10.1126/science.1149504.

- 12.
Mills RE: Mapping copy number variation by population-scale genome sequencing. Nature. 2011, 470 (7332): 59-65. 10.1038/nature09708.

- 13.
Chiang DY, Getz G, Jaffe DB, O’Kelly MJT, Zhao X, Carter SL, Russ C, Nusbaum C, Meyerson M, Lander ES: High-resolution mapping of copy-number alterations with massively parallel sequencing. Nat Methods. 2009, 6: 99-103. 10.1038/nmeth.1276.

- 14.
Xie C, Tammi MT: CNV-seq, a new method to detect copy number variation using high-throughput sequencing. BMC Bioinformatics. 2009, 10: 80-10.1186/1471-2105-10-80.

- 15.
Simpson JT, McIntyre RE, Adams DJ, Durbin R: Copy number variant detection in inbred strains from short read sequence data. Bioinformatics. 2010, 26 (4): 565-567. 10.1093/bioinformatics/btp693.

- 16.
Medvedev P, Fiume M, Dzamba M, Smith T, Brudno M: Detecting copy number variation with mated short reads. Genome Res. 2010, 20 (11): 1613-1622. 10.1101/gr.106344.110.

- 17.
Waszak SM, Hasin Y, Zichner T, Olender T, Keydar I, Khen M, Stütz AM, Schlattl A, Lancet D, Korbel JO: Systematic inference of copy-number genotypes from personal genome sequencing data reveals extensive olfactory receptor gene content diversity. PLoS Comput Biol. 2010, 6: e1000988-10.1371/journal.pcbi.1000988.

- 18.
Kim TM, Luquette LJ, Xi R, Park PJ: rSW-seq: algorithm for detection of copy number alterations in deep sequencing data. BMC Bioinformatics. 2010, 11: 432-10.1186/1471-2105-11-432.

- 19.
Ivakhno S, Royce T, Cox AJ, Evers DJ, Cheetham RK, Tavaré S: CNAseg-a novel framework for identification of copy number changes in cancer from second-generation sequencing data. Bioinformatics. 2010, 26 (24): 3051-3058. 10.1093/bioinformatics/btq587.

- 20.
Boeva V, Zinovyev A, Bleakley K, Vert JP, Janoueix-Lerosey I, Delattre O, Barillot E: Control-free calling of copy number alterations in deep-sequencing data using GC-content normalization. Bioinformatics. 2011, 27 (2): 268-269. 10.1093/bioinformatics/btq635.

- 21.
Miller CA, Hampton O, Coarfa C, Milosavljevic A: ReadDepth: a parallel R package for detecting copy number alterations from short sequencing reads. PLoS ONE. 2011, 6: 16327-10.1371/journal.pone.0016327.

- 22.
Abyzov A, Urban AE, Snyder M, Gerstein M: CNVnator: an approach to discover, genotype, and characterize typical and atypical CNVs from family and population genome sequencing. Genome Res. 2011, 21 (6): 974-984. 10.1101/gr.114876.110.

- 23.
Gusnanto A, Wood HM, Pawitan Y, Rabbitts P, Berri S: Correcting for cancer genome size and tumour cell content enables better estimation of copy number alterations from next-generation sequence data. Bioinformatics. 2012, 28: 40-47. 10.1093/bioinformatics/btr593.

- 24.
Duan J, Zhang JG, Deng HW, Wang YP: Comparative studies of copy number variation detection methods for next generation sequencing technologies. Plos One. 2013, 8 (3): e59128-10.1371/journal.pone.0059128.

- 25.
Hormozdiari F: Combinatorial algorithms for structural variation detection in high-throughput sequenced genomes. Genome Res. 2009, 19: 1270-1278. 10.1101/gr.088633.108.

- 26.
Magi A: Bioinformatics for next generation sequencing data. Genes. 2010, 1: 294-307. 10.3390/genes1020294.

- 27.
Schwarz G: Estimating the dimension of a model. Annals Statist. 1978, 6: 461-464. 10.1214/aos/1176344136.

- 28.
Li H: The sequence alignment/map format and SAMtools. Bioinformatics. 2009, 25 (16): 2078-2079. 10.1093/bioinformatics/btp352.

- 29.
Langmead B, Trapnell C, Pop M, Salzberg SL: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 2009, 10 (3): R25-10.1186/gb-2009-10-3-r25.

- 30.
Lai WR: Comparative analysis of algorithms for identifying amplifications and deletions in array CGH data. Bioinformatics. 2005, 21: 3763-3770. 10.1093/bioinformatics/bti611.

- 31.
Chambolle A, Lions PL: Image recovery via total variation minimization and related problems. Numer Math. 1997, 76: 167-188. 10.1007/s002110050258.

- 32.
Huber PJ: Robust Statistics. 1981, New York: John Wiley

- 33.
Blake A, Zisserman A: Visual Reconstruction. 1987, Cambridge: The MIT Press

- 34.
Donoho DL: Compressed Sensing. IEEE Trans Inf Theory. 2006, 52 (4): 1289-1306.

- 35.
Candès EJ, Wakin MB: An introduction To compressive sampling. IEEE Signal Process Mag Signal Process Mag. 2008, 21-30.

- 36.
Tropp JA: Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans Inf Theory. 2006, 52 (3): 1030-1051.

- 37.
Osborne MR, Presnell B, Turlach BA: A new approach to variable selection in least squares problems. IMA J Numerical Anal. 2000, 20 (3): 389-403. 10.1093/imanum/20.3.389.

- 38.
Malioutov DM: Homotopy continuation for sparse signal representation. Proc. IEEE ICASSP, Volume V. 2005, Philadephia, 733-736.

- 39.
Efron B, Hastie T, Johnstone I, Tibshirani R: Least angle regression. Ann Stat. 2004, 32 (2): 407-499. 10.1214/009053604000000067.

- 40.
Harchaoui Z, Lévy-Leduc C: Catching change-points with Lasso. NIPS. 2007, 617-624.

- 41.
Tibshirani R: Regression shrinkage and selection via the Lasso. J R Stat Soc B. 1996, 58: 267-288.

- 42.
Duan J, Zhang JG, Lefante J, Deng HW, Wang YP: Detection of copy number variation from next generation sequencing data with total variation penalized least square optimization. IEEE International Conference on Bioinformatics and Biomedicine Workshops. 2011, Atlanta, 3-12.

- 43.
Tibshirani R, Bien J, Friedman J, Hastie T, Simon N, Taylor J, Tibshirani RJ: Strong rules for discarding predictors in lasso-type problems. J R Stat Soc B. 2012, 74: 2107-2115.

- 44.
Duan J, Soussen C, Brie D, Idier J, Wang YP: A sufficient condition on monotonic increase of the number of nonzero entry in the optimizer of ℓ-1 norm penalized least-square problem. Tech. rep., Department of Biomedical Engineering, Tulane University 2011

- 45.
Nikolova M: Local strong homogeneity of a regularized estimator. SIAM J Appl Mathematics. 2000, 61 (2): 633-658. 10.1137/S0036139997327794.

- 46.
Duan J, Soussen C, Brie D, Idier J, Wang YP: On LARS/homotopy equivalence conditions for over-determined LASSO. IEEE Signal Process Lett. 2012, 19 (12): 894-897.

- 47.
Hansen P: Analysis of discrete ill-posed problems by means of the L-curve. SIAM Rev. 1992, 34: 561-580. 10.1137/1034115.

- 48.
Akaike H: A new look at the statistical model identification. IEEE Trans Automat Contr. 1974, 19 (6): 716-723. 10.1109/TAC.1974.1100705.

- 49.
Markon KE, Krueger RF: An empirical comparison of information-theoretic selection criteria for multivariate behavior genetic models. Behavior Genetics. 2004, 34 (6): 593-610. 10.1007/s10519-004-5587-0.

- 50.
Chen J, Wang YP: A statistical change point model approach for the detection of DNA copy number variations in array CGH data. IEEE/ACM Trans Comput Biol Bioinformatics. 2009, 6: 529-541.

- 51.
Zhang CH: Discussion: One-step sparse estimates in nonconcave penalized likelihood models. Ann Stat. 2008, 36 (4): 1509-1533. 10.1214/009053607000000802.

- 52.
Klambauer G, Schwarzbauer K, Mayr A, Clevert DA, Mitterecker A, Bodenhofer U, Hochreiter S: cn.MOPS: mixture of Poissons for discovering copy number variations in next-generation sequencing data with a low false discovery rate. Nucleic Acids Res. 2012, 40 (9): e69-10.1093/nar/gks003.

- 53.
Li H: The sequence alignment/map format and SAMtools. Bioinformatics. 2009, 25 (16): 2078-2079. 10.1093/bioinformatics/btp352.

- 54.
Bentley DR: Accurate whole human genome sequencing using reversible terminator chemistry. Nature. 2008, 456: 53-59. 10.1038/nature07517.

- 55.
Alkan C, Kidd JM, Marques-Bonet T, Aksay G, Antonacci F, Hormozdiari F, Kitzman JO, Baker C, Malig M, Mutlu O, Sahinalp SC, Gibbs RA, Eichler EE: Personalized copy number and segmental duplication maps using next-generation sequencing. Nat Genet. 2009, 41: 1061-1067. 10.1038/ng.437.

- 56.
Medvedev P, Stanciu M, Brudno M: Computational methods for discovering structural variation with next-generation sequencing. Nat Methods. 2009, 6: S13—S20-

- 57.
Zhu M, Need AC, Han Y, Ge D, Maia JM, Zhu Q, Heinzen EL, Cirulli ET, Pelak K, He M, Ruzzo EK, Gumbs C, Singh A, Feng S, Shianna KV, Goldstein DB: Using ERDS to infer copy-number variants in high-coverage genomes. Am J Hum Genet. 2012, 91 (3): 408-421. 10.1016/j.ajhg.2012.07.004.

- 58.
He D, Hormozdiari F, Furlotte N, Eskin E: Efficient algorithms for tandem copy number variation reconstruction in repeat-rich regions. Bioinformatics. 2011, 27 (11): 1513-1520. 10.1093/bioinformatics/btr169.

## Acknowledgements

This study was partially supported by NIH, NSF, and Shanghai Eastern Scholarship Program.

## Author information

### Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

JD, J-GZ, Y-PW and H-WD designed this study. JD and J-GZ wrote the code for the comparative study. JD wrote the manuscript, J-G Zhang and Y-PW revised the manuscript. All have read the manuscript and approved the final version.

## Electronic supplementary material

## Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

## Rights and permissions

## About this article

### Cite this article

Duan, J., Zhang, JG., Deng, HW. *et al.* CNV-TV: A robust method to discover copy number variation from short sequencing reads.
*BMC Bioinformatics* **14, **150 (2013). https://doi.org/10.1186/1471-2105-14-150

Received:

Accepted:

Published:

### Keywords

- Copy Number Variation
- Lasso
- Test Genome
- Next Generation Sequencing Data
- Copy Number Variation Region