Skip to main content

An improved method for detecting and delineating genomic regions with altered gene expression in cancer


Genomic regions with altered gene expression are a characteristic feature of cancer cells. We present a novel method for identifying such regions in gene expression maps. This method is based on total variation minimization, a classical signal restoration technique. In systematic evaluations, we show that our method combines top-notch detection performance with an ability to delineate relevant regions without excessive over-segmentation, making it a significant advance over existing methods. Software (Rendersome) is provided.


Alterations in gene expression patterns, resulting from acquired genetic and epigenetic changes, are a characteristic feature of cancer cells. Recently, several studies have shown that the expression of a considerable fraction of genes located in regions of gains or losses of chromosomal material varies consistently with DNA copy number, leading to altered (biased) gene expression in such regions [111]. Conversely, additional studies suggest that gene expression biases inferred from expression maps are either caused by underlying genomic imbalances [1217] or long-range epigenetic mechanisms, including DNA methylation or histone modification across large chromosomal regions [18, 19]. Thus, the analysis of microarray data from tumors with respect to alterations in regional gene expression is potentially useful for studying relationships between DNA copy number and gene expression, mining pre-existing expression array data for imbalanced chromosomal aberrations [20] or identifying genomic regions that are susceptible to epigenetic change [19].

A central problem associated with the identification of genomic regions with biased gene expression is to partition the expression map into contiguous regions that share the same baseline expression level (bias) on average. This process, called segmentation, serves to reconstruct (or restore or de-noise) the underlying expression bias profile from the primary data, and to detect relevant regions and delineate their boundaries. In principle, segmentation of expression maps is analogous to reconstructing DNA copy number profiles from array comparative genome hybridization (aCGH) or single nucleotide polymorphism (SNP) arrays. However, additional challenges are present that make the problem harder. First, the genomic resolution of expression arrays is coarser, that is there are fewer probes per chromosome. Second, the signal-to-noise ratio (SNR) is lower, in the sense that the expression biases we aim to detect are moderate in comparison with the intrinsic variability in gene expression. Third, the expression of some genes may not be influenced by the underlying genomic change. For example, copy number gains are unlikely to increase the expression of genes whose necessary transcriptional activators are absent.

In the present study, we describe an improved method for detecting and delineating genomic regions with biased gene expression in cancer. The proposed method differs from previous proposals in two important respects. First, the method is based on total variation (TV) minimization, a classical approach for recovering signals or images corrupted by noise [21]. Second, whereas existing segmentation methods target aCGH and SNP data, our method is optimized for expression microarray data. We show how to adapt the TV minimization technique for the segmentation of gene expression maps and derive efficient algorithms for its computation. In systematic evaluations, we show that segmentation by TV minimization combines enhanced detection performance with an enhanced ability to delineate relevant regions, making it a significant advance over existing segmentation techniques. We also verify that our method is capable of identifying regions with expected increases/decreases in the average level of gene expression, in this case on the basis of known imbalanced chromosomal aberrations in childhood acute lymphoblastic leukemia (ALL). Finally, we provide a software package, Rendersome, which is publicly available.


Evaluation by simulation

We first performed a series of simulations, which were designed to assess the ability of the proposed method to identify genomic regions with biased gene expression under varying conditions. As described in detail in Materials and methods, we repeatedly simulated artificial 'chromosomes' containing a centrally located biased region (a square wave step), mixed with a randomly generated high-frequency signal corresponding to noise plus the intrinsic variability in expression between genes (Figure 1). The type of expression profiles generated by this model is controlled by four parameters: the length of the chromosome, the width of the biased region in the center, the SNR and the proportion of genes (π) that are not influenced by the underlying genomic alteration. By varying these parameters, we could artificially recreate gene expression maps with a wide variety of signal characteristics.

Figure 1
figure 1

Simulation model. Blue solid: Original gene expression bias profile containing a centrally located region with increased expression. Black dotted: Corresponding gene scores, generated by mixing a high-frequency signal component into the original bias profile (details in Materials and methods). Left: Example signal generated with 40-probe step with SNR 2.0, and no non-influenced genes (π = 0.0). Right: Corresponding signal with a higher proportion of non-influenced genes (π = 0.3).

To ensure comprehensive testing, we selected parameter combinations from broad and relevant intervals (Materials and methods). For each set of parameters, we generated a series of artificial chromosomes and assessed the detection performance, delineation performance and the visual performance of the proposed method plus a control method. As control methods, we considered CGHseg by Picard et al [22] and DNAcopy by Olshen et al [23]. These methods have been evaluated recently by extensive simulation and by application to real data [24, 25] and were found to compare favorably to other segmentation techniques. In particular, Lai et al [24] noted that CGHseg, followed by DNAcopy, performed consistently well for a broad range of conditions, including low SNRs which is the most relevant case here. In agreement with [24], we found CGHseg to perform better than, or on par with, DNAcopy (data not shown). Hence, we selected a CGHseg as a state-of-the-art method to compare our results with.

Detection performance

We first computed the receiver operating characteristics (ROC) curves for each segmentation technique to assess the detection performance (that is, the trade-off between sensitivity and specificity for detecting relevant regions) in each case. To generate ROC curves for specific combinations of simulation parameters, we calculated the true positive rates (TPRs) and false positive rates (FPRs) across 200 simulated 100-probe chromosomes as we varied the threshold for calling probes relevant (Materials and methods). This approach has been previously established as an appropriate way to evaluate segmentation methods [24, 25].

As shown in Figure 2 and Additional file 1, the proposed method exhibited considerably stronger ROC curves. The difference was present throughout, and was particularly pronounced for low to intermediate SNRs (the most expression data-like conditions). The proposed method also displayed the best performance when the proportion of 'non-influenced genes' was high. We conclude that the proposed algorithm offers an improved trade-off between sensitivity and specificity when determining aberration, especially under conditions that are likely to apply in real gene expression maps.

Figure 2
figure 2

Receiver operating characteristics. To assess the ability of the proposed method to detect genomic regions with biased gene expression, we determined its ROC curve for different SNRs, aberration sizes and proportions of non-influenced genes (Materials and methods and also Figure 1). This figure (π = 0.1) represents an excerpt from the full set of results (Additional file 1). Key observations: (1) the proposed method exhibits stronger detection performance than the control method (CGHseg); (2) the improvement is present throughout, but is particularly pronounced for low to intermediate SNRs. We conclude that the proposed method exhibits a better trade-off between sensitivity and specificity, especially under expression data-like conditions.

Delineation performance

We next assessed the ability to delineate the boundaries of relevant regions. To achieve this, we generated and segmented 10,000 artificial chromosomes for each set of simulation parameters. Based on the segmentation results across all chromosomes, we computed the relative breakpoint frequency at each chromosomal position. In doing this, we obtain a set of 'breakpoint maps' that reveal how often, and how precisely, a segmentation method identifies the true breakpoints (Materials and methods).

As shown in Figure 3 and Additional file 2, the breakpoint distributions of the TV-based segmentation scheme stand out in two important respects. First, the proposed algorithm yielded higher histogram peaks at, or near, the true breakpoints (in our case, the edges of the centrally located biased region). Thus, given that the algorithm reports a breakpoint, the probability that it is located at, or near, a true breakpoint is higher. Second, the breakpoint distributions of the proposed algorithm display a markedly 'scooped' center, that is there is little distributional mass (fewer breakpoints) inside the relevant region.

Interestingly, this finding signifies that the TV-based scheme, to a great extent, manages to avoid reporting false breakpoints inside relevant regions. This improvement is a result of the fact that the proposed method explicitly seeks to segment relevant regions 'in one piece' (Materials and methods). The differences in breakpoint distribution could be observed throughout but were particularly pronounced for low and intermediate SNRs (Additional file 2). We conclude that, in addition to stronger ROC curves, the proposed algorithm identifies the correct region breakpoints with higher probability and detects relevant regions without excessive over-segmentation.

Figure 3
figure 3

Breakpoint distributions. To assess the ability of the proposed method to delineate relevant regions, determined its breakpoint distributions for different simulation parameters (Materials and methods). This figure (π = 0.1) represents an excerpt from the full set of results (Additional file 2). Key observations are as follows. (1) The distributions of the proposed method exhibit significantly higher 'peaks' around the true breakpoints (vertical dotted lines). This signifies that, given that the proposed method detects a breakpoint, the probability that it is a true breakpoint is higher. (2) The distributions for the proposed methods exhibit markedly 'scooped' centers, that is, there is less distributional mass (fewer breakpoints) inside the relevant segment. Thus, the method detects fewer false breakpoints inside relevant regions, even when the region is large. This improvement is a result of the use of multiple regularization parameter values (Materials and methods). (3) As in Figure 2, the improvements were particularly pronounced under expression data-like conditions. In this test, T μ = 0.5·SNR (similar results for other reasonable values).

Visual performance

As the third and final part of the performance comparison, we decided to examine segmentation results obtained on simulated examples. As before, we mixed a piece-wise constant expression bias profile into a randomly generated high-frequency component (as described in the Simulation model section). In this case, however, we placed five biased regions of varying widths (10, 20, 30, 40 and 50 probes) along the same chromosome (Figure 4). For each combination of SNR and proportion of non-influenced genes, we generated and inspected 10 examples visually. Throughout, the TV-based scheme generally produced segmentation results that more closely resembled the original (uncorrupted) signal. Admittedly, visual evaluations of this type are prone to subjectivity and should be interpreted with caution. Still, the results obtained were consistent with, and partially explain, the improvements observed in the first two experiments.

Figure 4
figure 4

Application to synthetic data. For illustration, we applied the different methods to a large set of synthetic examples. Left: Original gene expression bias profile. Middle: Results for proposed method. Right: Results for CGHseg. As evident, the proposed method better succeeds in recovering the true expression bias profile, especially under rough conditions. The example shown was generated using π = 0.2, but agreeing results were obtained for π = 0.0 to 0.5. In this test, T μ = 0.5·SNR (similar results for other reasonable values).

Application to real data

We proceeded to apply TV minimization-based segmentation to real expression microarray data to verify its ability to identify regions with expected increases/decreases in average gene expression. To achieve this, we used the data set generated by Ross et al [26], consisting of expression profiles of childhood ALLs, classified by genetic subtype (Table 1). This disease subclassification builds on cytogenetic and molecular genetic criteria, and is instrumental for the diagnostic, prognostic and therapeutic stratification of ALL patients in clinical practice [27]. Of interest here is that each genetic subtype is characterized by recurrent, well-defined chromosomal aberrations [28]. Some of these aberrations are balanced translocations whereas some are imbalanced aberrations (gains or losses of chromosomal material). The latter type of aberration alter the DNA copy number (the 'gene dose') and hence can be expected to cause increased/decreased gene expression across the engaged chromosome or chromosomal segment. We seek to test whether the proposed method succeeds in identifying regions that correspond to common imbalanced chromosomal aberrations in specific leukemic subtypes.

Table 1 Characteristics of the test data. Contents of the Ross data set [26] of expression profiles of childhood acute lymphoblastic leukemias (ALL). The elements indicate the numbers of cases of each leukemic subtype, as defined by cytogenetic and molecular genetic criteria according to the World Health Organization (WHO) classification system [27]. Also outlined are the clinical characteristics and defining genetic change of each leukemic subtype.

The technical details are given in Materials and methods. In short, all expression data were converted to a log-scale, normalized with respect to out-of-class cases and then segmented. The original and segmented data were plotted, both case-by-case and class-by-class. The class-by-class plots represent the average segmentation result across all cases of each leukemic subtype, and hence emphasize recurrent alterations in expression while suppressing sporadic changes and noise. To provide a map of frequent imbalanced chromosomal aberrations in ALL we overlaid average DNA copy number profiles for each leukemic subtype, as computed from high-resolution SNP array data by Mullighan et al [29]. The copy number profiles indicate which regions that can be expected to show increased/decreases in expression on the basis of common gains or losses of chromosomal material, but do not indicate regional biases that have other causes.

As illustrated in Figure 5 and Additional file 3, the TV method was able to identify numerous regions with biased expression in the specific leukemic subtypes. In broad outline, the key observations were as follows. In hyperdiploid ALL, each case exhibited elevated gene expression across one or more of the chromosomes 4, 6, 10, 14, 17, 18, 21 and X. This observation is consistent with the well-known fact that hyperdiploid ALL is characterized by extra copies of these chromosomes, and generally exhibits a total of more than 50 chromosomes (median 55). The finding is also consistent with previous studies indicating that a substantial proportion of the genes located on the gained chromosomes exhibit higher-than-expected expression levels on average [2, 26]. In TCF3/PBX1-positive ALL, the most striking finding was that, in the majority of cases, a large region on 1q distal to the PBX1 locus was over-expressed whereas a small region (~1.6 Mb) on 19p distal to the TCF3 locus was under-expressed (Figure 6). These observations are in accordance with the fact that the TCF3/PBX1 fusion oncogene is the result a reciprocal translocation between chromosomes 1 and 19, where the translocated chromosome 19 is retained whereas the rearranged chromosome 1 is lost, followed by a reduplication of the normal chromosome 1 homologue [30]. In other words, the leukemic cells will exhibit a gain of 1q material and a loss of 19p material, where the latter aberration is usually cytogenetically invisible. In ETV6/RUNX1-positive ALL, recurrent changes in expression were observed in 6p22, 18q12, 21q22 and Xq25-28. Out of these, the over-expression over Xq25-28 was found to be particularly striking (Figure 7). Interestingly, this region was not known to be recurrently gained in ETV6/RUNX1-positive ALL until recently when, following more detailed aCGH-based investigations by us, the region was shown to be frequently duplicated [20]. In MLL-rearranged and BCR/ABL1-positive ALL, no convincing recurrent changes were found. Finally, in T-ALL, we observed numerous differentially expressed regions. The degree of differential expression in these regions was generally very high, suggesting that the underlying mechanism is regulatory rather than a gene-dose effect on the basis of underlying DNA copy number aberrations. Taken together, these results support that the described method is capable of identifying genomic regions with expectedly increased/decreased average gene expression, in the cases shown on the basis of imbalanced chromosomal aberrations (including examples of cytogenetically invisible changes).

Figure 5
figure 5

Application to childhood ALL data. To verify the ability of the proposed method to identify genomic regions with expected increases/decreases in average gene expression, we applied it to the data set by Ross et al [26] (Affymetrix U133A+B arrays). Each case was normalized and segmented as described in Materials and methods. Blue solid: Average segmentation result across all cases of each leukemic subtype (Table 1). Orange: Average DNA copy number profile across within each class, as determined from the Mullighan et al data set [29] (Affymetrix 250 k SNP arrays). Key observation: The method successfully identified several regions with altered gene expression (details in Results). The case-specific segmentations are provided in Additional file 3. In this example, T μ = 0.25 (similar results for other reasonable values).

Figure 6
figure 6

Application to childhood ALL with TCF3/PBX1 gene fusion. Segmentations of the expression maps of chromosomes 1 and 19 in 18 cases of ALL exhibiting the TCF3/PBX1 fusion oncogene (Ross et al data set) using different method parameters. Light grey: original gene scores. Dark blue: reconstructed expression bias profile. Top: λ N = 2/5. Middle: λ N = 2/15 Bottom: λ N = 2/30. Key observations are as follows. (1) Most cases display over-expression in 1q distal to the PBX1 locus and under-expression over a ~1.6 Mb region on 19p distal to the TCF3 locus (translocation breakpoints indicated by vertical bars). The explanation for this finding is discussed in the Results section. (2) Reducing λ N allows the algorithm to emphasize on larger regions, while suppressing smaller regions.

Figure 7
figure 7

Application to childhood ALL with ETV6/RUNX1 gene fusion. Segmentations of the expression map of the X chromosome in 20 cases of ALL harboring the ETV6/RUNX1 fusion. Light grey: original gene scores. Dark blue: reconstructed expression bias profile. Top: λ N = 2/5. Middle: λ N = 2/15 Bottom: λ N = 2/30. Key observations are as follows. (1) Several cases exhibited over-expression in Xq25-28, a chromosomal region that was not known to be recurrently gained in ETV6/RUNX1-positive ALL until recently. Following more detailed investigations at our lab using aCGH, the region was shown to be frequently duplicated in this leukemic subtype [20]. Thus, this finding further supports that the proposed method is able to detect genomic regions which expected biases in gene expression, in this case on the basis of a cytogenetically invisible chromosomal aberration. (2) As in Figure 6, reducing λ N allows the algorithm to emphasize on larger regions, while suppressing smaller regions.

For completeness, we note that detected segments corresponding to duplications and deletions display step heights around 0.5 to 1.0. Given that the variance of the gene scores is approximately one, this indicates that the SNRs used in the simulations are adequate (Materials and methods). We also note that the widths and heights of the smaller segments detected were in line with the resolutions predicted by Equation 7, supporting that this way of calculating the regularization parameters is reasonable. Finally, we remark that segmentation without prior normalization (except log-scale conversion) yielded poor results, verifying the necessity of using appropriately normalized gene scores (Materials and methods).


Genomic regions with altered gene expression arise in cancer cells because of acquired gains or losses of chromosomal material or epigenetic changes. The detection and delineation of such regions in gene expression maps relies on the availability of specialized segmentation techniques.

We have described a novel segmentation method based on TV minimization. The value of this method lies in that it combines significantly improved detection performance with an enhanced ability to delineate relevant regions. The explanation for these improvements is two-fold. First, adopting the TV norm as a regularity measure makes the segmentation procedure more robust under low SNRs. Previously, the TV norm has been successfully applied to numerous restoration problems in signal and image processing, including problems in bioinformatics [31]. Second, to extend further the performance of TV minimization, we have introduced a novel strategy for using multiple regularization parameters simultaneously. This feature allows for improved detection of regions with widely varying characteristics, while still allowing large regions to be detected without excessive over-segmentation.

Previously, other segmentation methods have been proposed. In contrast to our method, these are primarily tuned for aCGH or SNP array data, and perform less well under expression data-like conditions [24, 25]. Similar to our method, a common theme is to fit piece-wise constant solutions to the data by dynamic programming under various goodness criteria, including penalized likelihood [22], penalized least squares [32], Bayesian posterior probability [33], edit distances [34] or hidden Markov models [3537]. However, previous methods regularize the solution using a constant step penalty, impeding their performance on expression data. Other methods that are not based on dynamic programming but with similar behavior have been proposed [23, 3840], as have various smoothing methods [13, 4148]. The latter do not produce a segmentation, but, in some cases, tend to blur the edges between regions.

Using childhood ALL as an example, we have verified that our method is capable of identifying regions with increased/decreased expression on the basis of known chromosomal imbalances (including gross abnormalities as well as cytogenetically invisible aberrations). Previously, Callegaro et al [41] analyzed the Ross et al data set using an adaptive filtering approach. These authors found a differentially expressed region around the PBX1 locus on chromosome 1 in TCF3/PBX1-positive ALL, but did not report the footprints in expression of chromosomal imbalances revealed here. The Ross et al data were also studied by Hertzberg et al [2] who demonstrated the predictability of whole-chromosome gains in hyperdiploid ALL, but did not analyze the data at the sub-chromosomal level.

Technically, our scheme differs from the original TV scheme [21] in that we require the solution to be piece-wise constant instead of piece-wise continuous. The motivation for this restriction is four-fold. First, the piece-wise continuous model is less well suited for noisy conditions, partly because of its higher flexibility [49]. Second, a piece-wise constant signal model is natural in our application. Third, we achieve simultaneous de-noising and segmentation. Fourth, the globally optimal solution to the piece-wise constant TV minimization problem can be rapidly computed by dynamic programming.

The behavior of our method is controlled by the set of λ and the relevance threshold. Of note, we provide theory to calculate suitable λ, which hence can be regarded as more or less 'fixed'. Thus, the only parameter the user has to select is the relevance threshold. This parameter is easy to interpret.

Regarding possible improvements, we note that estimating μ i as the average of f over I i is reasonable when π i is near zero, but does not compensate for the fact that 'non-influenced genes' pull the estimate towards zero when π i is large. In principle, this artifact could be avoided by estimating μ i and π i using more advanced techniques, such as mixture-fitting. We have refrained from such extensions because of the anticipated computational overhead, and leave improvements in this direction as an open problem.


In conclusion, we have described an enhanced methodology for identifying genomic regions with altered gene expression in cancer. Hence, this work, along with other efforts, should facilitate the search for genetic and epigenetic changes involved in cancer development.

Materials and methods

Problem definition

Let f (x) : IR be the gene expression score at chromosomal position x in some interval I (one such score is discussed below). This expression map can be regarded as a mixture of two signal components: a high-frequency component v(x) that corresponds to noise plus intrinsic variability in gene expression, and a low-frequency component u(x) that represents a more slowly varying gene expression bias profile. The segmentation problem can be formulated as the reconstruction of u(x) from f (x) subject to the constraint that u(x) is piece-wise constant, that is u(x) = μ i , x I i for some plateau levels μ i B MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWefv3ySLgznfgDOjdaryqr1ngBPrginfgDObcv39gaiqaacqWFbcVqaaa@3B7B@ and some set of ordered intervals I1, I2, ..., I M representing a disjoint partitioning covering I with a varying number of segments M (true number unknown a priori).

Segmentation by piece-wise constant TV minimization

We propose to reconstruct u from f by solving the variational problem

u = min I | u | + λ ( u f ) 2 d x , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8GiVeY=Pipec8Eeeu0xXdbba9frFj0xb9Lqpepeea0xd9q8qiYRWxGi6xij=hbbc9s8aq0=yqpe0xbbG8A8frFve9Fve9Fj0dmeaabaqaciaacaGaaeqabaqabeGadaaakeaacaWG1bWaaWbaaSqabeaacqGHxiIkaaGccqGH9aqpciGGTbGaaiyAaiaac6gadaWdraqaamaaemaabaGabmyDayaafaaacaGLhWUaayjcSdGaey4kaSccciGae83UdWMaaiikaiaadwhacqGHsislcaWGMbGaaiykamaaCaaaleqabaGaaGOmaaaakiaadsgacaWG4baaleaacaWGjbaabeqdcqGHRiI8aOGaaiilaaaa@4796@

where u is piece-wise constant. In the integrand, the first term is the L1 norm of u', also known as the TV norm of u. In this application, we interpret the TV norm literally, meaning that it is equal to the sum of the magnitudes of the steps in u (because u' is Dirac at the change points). Thus, it is clear that the role of the first term is to regularize the solution and prevent over-segmentation. By contrast, the second term is an L2 fidelity term, or fitting term, serving to impose consistency with the original data and to counteract under-segmentation. The relative impact of the two competing terms is determined by the regularization parameter λ > 0. Trivially, λ = 0 produces the constant solution u = Average {f j }i I(the most rigid model), whereas λ → ∞ implies u* → f (the most flexible model). The choice of regularization parameter is discussed in detail in the following.

For computational tractability, we restrict the set of feasible solutions to the set of u such that { μ i } 1 M MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGaai4EaGGaciab=X7aTnaaBaaaleaacaWGPbaabeaakiaac2hadaqhaaWcbaGaaGymaaqaaiaad2eaaaaaaa@363C@ is equal to the means of f over { I i } 1 M MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGaai4EaiaadMeadaWgaaWcbaGaamyAaaqabaGccaGG9bWaa0baaSqaaiaaigdaaeaacaWGnbaaaaaa@354D@ . The benefit of this maneuver is that u will be uniquely defined for any partitioning, meaning that finding u* is reduced to finding an optimal partitioning of I which can be performed efficiently. The limitation is that we no longer account for the fact that the optimal μ i can be different from the mean over I i and there is strain on the solution.

To find the optimal solution to the restricted version of the problem, we convert from continuous to discrete form, adopting the notation f j = f (x j ) where x j are the positions of probe j = 1, ..., N in ascending order along the chromosome. We obtain the discrete-form objective

J ( u ) = i = 2 M | μ i 1 μ i | + λ i = 1 M j I i ( μ i f j ) 2 , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8GiVeY=Pipec8Eeeu0xXdbba9frFj0xb9Lqpepeea0xd9q8qiYRWxGi6xij=hbbc9s8aq0=yqpe0xbbG8A8frFve9Fve9Fj0dmeaabaqaciaacaGaaeqabaqabeGadaaakeaat0uy0HwzTfgDPnwy1egaryqtHrhAL1wy0L2yHvdaiqaacqWFjeVscaGGOaGaamyDaiaacMcacqGH9aqpdaaeWbqaamaaemaabaacciGae4hVd02aaSbaaSqaaiaadMgacqGHsislcaaIXaaabeaakiabgkHiTiab+X7aTnaaBaaaleaacaWGPbaabeaaaOGaay5bSlaawIa7aaWcbaGaamyAaiabg2da9iaaikdaaeaacaWGnbaaniabggHiLdGccqGHRaWkcqGF7oaBdaaeWbqaamaaqafabaGaaiikaiab+X7aTnaaBaaaleaacaWGPbaabeaakiabgkHiTiaadAgadaWgaaWcbaGaamOAaaqabaGccaGGPaWaaWbaaSqabeaacaaIYaaaaaqaaiaadQgacqGHiiIZcaWGjbWaaSbaaWqaaiaadMgaaeqaaaWcbeqdcqGHris5aaWcbaGaamyAaiabg2da9iaaigdaaeaacaWGnbaaniabggHiLdGccaGGSaaaaa@67FA@

where equal probe spacing has been assumed when discretizing the integral. The calculations can be modified to accommodate for unequally spaced probes if needed (not shown).

Next, we let n be an integer such that 1 ≤ n = N and J n MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8xcXR0aa0baaSqaaiaad6gaaeaacqGHxiIkaaaaaa@3D36@ the value of the objective function for the optimal segmentation of the (closed) integer interval [1, n]. Further, we let n', 1 ≤ n'n be the starting point for the last segment in that segmentation, and n" be the starting point of the last interval of the optimal segmentation of [1, n']. Finally, we let the functions μ(a, b) and ν (a, b) denote the average and sum-of-squares about the average, respectively, of f over [a, b]. In this notation, Equation 2 reads

J n = min n { J n 1 + | μ ( n , n 1 ) μ ( n , n ) | + λ ν ( n , n ) } . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8xcXR0aa0baaSqaaiaad6gaaeaacqGHxiIkaaGccqGH9aqpdaWfqaqaaiGac2gacaGGPbGaaiOBaaWcbaGabmOBayaafaaabeaakiaacUhacqWFjeVsdaqhaaWcbaGabmOBayaafaGaeyOeI0IaaGymaaqaaiabgEHiQaaakiabgUcaRmaaemaabaacciGae4hVd0Maaiikaiqad6gagaGbaiaacYcaceWGUbGbauaacqGHsislcaaIXaGaaiykaiabgkHiTiab+X7aTjaacIcaceWGUbGbauaacaGGSaGaamOBaiaacMcaaiaawEa7caGLiWoacqGHRaWkcqGF7oaBcqGF9oGBcaGGOaGabmOBayaafaGaaiilaiaad6gacaGGPaGaaiyFaiaac6caaaa@64E7@

Thus, given the optimal values of the objective function for the intervals [1, 1], [1, 2], ..., [1, n - 1], the optimal value of the objective for the next interval [1, n] can be computed explicitly. In other words, the problem satisfies the Bellman condition of optimality [50], and the inductive solution given by Equation 3 represents the forward pass of a dynamic programming scheme. For clarity, we give the details of the algorithm in pseudocode (Additional file 4). In its basic form, the algorithm is O(N3) in time and O(N) in memory. However, the time complexity can be reduced to O(N2) by loop unfolding (Additional file 4).

Selection of regularization parameter

The traditional way to select λ in TV minimization is as follows. Let u ^ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGabmyDayaajaaaaa@30AB@ (x, λ) denote the u(x) estimate for a specific value of λ. If we assume for a while that the signal is purely additive (that is, f (x) = u(x) + v(x)), then the difference f (x) - u ^ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGabmyDayaajaaaaa@30AB@ (x, λ) will represent an estimate of the high-frequency component v(x) if λ has been chosen correctly. If, in addition, v(x) is independently and identically distributed with variance σ2, a natural constraint on λ is

Var { v ^ ( x , λ ) } = Var { f ( x ) u ^ ( x , λ ) } σ 2 . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8GiVeY=Pipec8Eeeu0xXdbba9frFj0xb9Lqpepeea0xd9q8qiYRWxGi6xij=hbbc9s8aq0=yqpe0xbbG8A8frFve9Fve9Fj0dmeaabaqaciaacaGaaeqabaqabeGadaaakeaacaqGwbGaaeyyaiaabkhacaGG7bGabmODayaajaGaaiikaiaadIhacaGGSaacciGae83UdWMaaiykaiaac2hacqGH9aqpcaqGwbGaaeyyaiaabkhacaGG7bGaamOzaiaacIcacaWG4bGaaiykaiabgkHiTiqadwhagaqcaiaacIcacaWG4bGaaiilaiab=T7aSjaacMcacaGG9bGaeyisISRae83Wdm3aaWbaaSqabeaacaaIYaaaaOGaaiOlaaaa@4F7A@

This constraint is often used as a 'rule-of-thumb' stating that λ should be selected such that the variance of the residual v ^ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGabmODayaajaaaaa@30AC@ (x, λ) is on par with σ2, which, in turn, can be estimated from the data or is known a priori.

While straightforward, the traditional way of selecting λ is inappropriate in our application. First, a purely additive signal model is too simplistic as some genes may not be influenced by the underlying genomic change. This undermines the validity of Equation 4. Second, it is diffcult to find a single λ that suits all region sizes simultaneously. Small λ allow the baseline to 'break up', and hence allow small regions to be detected. At the same time, however, relevant regions will become over-segmented (fragmented), which is undesirable. Conversely, large λ values will keep large regions intact, whereas small regions cannot be identified.

To alleviate this issue, we developed an extended TV minimization-based scheme that allows a range of λ values to be used simultaneously, as opposed to relying on a single value. We proceeded as follows. First, let λ1 <λ2 < <λ N be an increasing sequence of λ values, and T μ a threshold that specifies the smallest plateau level |μ i | that is required for a segment to be called 'relevant'. Second, segment I using λ1 as regularity parameter (most rigid model). Third, mark all segments that satisfy μ i > T μ as finished and exclude them from further processing. Fourth, the subintervals that are 'non-relevant', that is whose |μ i | do not exceed T μ are re-segmented using λ2 (slightly less rigid model). The process is repeated with λ3, λ4, and so on until λ N is reached, or no more 'non-relevant' regions remain. In other words, the segmentation scheme first searches for large, relevant regions and then proceeds to search for successively smaller regions in a recursive manner. Thus, the algorithm allows large relevant regions to be detected without excessive over-segmentation, while still allowing smaller regions to be detected.

To obtain guidance for the selection of the λ series, we considered the following hypothetical case. Assume that the gene expression map of I is non-biased everywhere, except in a contiguous region I' I where gene expression is biased (that is, the mean gene score is non-zero). Let J 0 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8xcXR0aaWbaaSqabeaacaaIWaaaaaaa@3C0E@ denote the value of the total variation functional (Equation 1) for the one-segment solution u(x) = 0 for all x I, including I'.

Similarly, let J 1 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8xcXR0aaWbaaSqabeaacaaIXaaaaaaa@3C0F@ denote the value of the functional for a three-segment solution where u(x) is zero when x I\I' but the average of f j over I when x I '. By Equation 1, we have

J 0 J 1 = λ i I f j 2 ( 2 N | i I f j | + λ i I f j 2 λ 1 N ( i I f j ) 2 ) , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8GiVeY=Pipec8Eeeu0xXdbba9frFj0xb9Lqpepeea0xd9q8qiYRWxGi6xij=hbbc9s8aq0=yqpe0xbbG8A8frFve9Fve9Fj0dmeaabaqaciaacaGaaeqabaqabeGadaaakeaat0uy0HwzTfgDPnwy1egaryqtHrhAL1wy0L2yHvdaiqaacqWFjeVsdaahaaWcbeqaaiaaicdaaaGccqGHsislcqWFjeVsdaahaaWcbeqaaiaaigdaaaGccqGH9aqpiiGacqGF7oaBdaaeqbqaaiaadAgadaqhaaWcbaGaamOAaaqaaiaaikdaaaGccqGHsisldaqadaqaaKqbaoaalaaabaGaaGOmaaqaaiqad6eagaqbaaaakmaaemaabaWaaabuaeaacaWGMbWaaSbaaSqaaiaadQgaaeqaaaqaaiaadMgacqGHiiIZceWGjbGbauaaaeqaniabggHiLdaakiaawEa7caGLiWoacqGHRaWkcqGF7oaBdaaeqbqaaiaadAgadaqhaaWcbaGaamOAaaqaaiaaikdaaaGccqGHsislcqGF7oaBjuaGdaWcaaqaaiaaigdaaeaaceWGobGbauaaaaaaleaacaWGPbGaeyicI4SabmysayaafaaabeqdcqGHris5aOWaaeWaaeaadaaeqbqaaiaadAgadaWgaaWcbaGaamOAaaqabaaabaGaamyAaiabgIGiolqadMeagaqbaaqab0GaeyyeIuoaaOGaayjkaiaawMcaamaaCaaaleqabaGaaGOmaaaaaOGaayjkaiaawMcaaaWcbaGaamyAaiabgIGiolqadMeagaqbaaqab0GaeyyeIuoakiaacYcaaaa@7500@

where N' is the number of genes in I'. The right-hand side simplifies to

2 N | i I f j | + λ N ( i I f j ) 2 , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8GiVeY=Pipec8Eeeu0xXdbba9frFj0xb9Lqpepeea0xd9q8qiYRWxGi6xij=hbbc9s8aq0=yqpe0xbbG8A8frFve9Fve9Fj0dmeaabaqaciaacaGaaeqabaqabeGadaaakeaajuaGcqGHsisldaWcaaqaaiaaikdaaeaaceWGobGbauaaaaGcdaabdaqaamaaqafabaGaamOzamaaBaaaleaacaWGQbaabeaaaeaacaWGPbGaeyicI4SabmysayaafaaabeqdcqGHris5aaGccaGLhWUaayjcSdGaey4kaSscfa4aaSaaaeaaiiGacqWF7oaBaeaaceWGobGbauaaaaGccaGGOaWaaabuaeaacaWGMbWaaSbaaSqaaiaadQgaaeqaaaqaaiaadMgacqGHiiIZceWGjbGbauaaaeqaniabggHiLdGccaGGPaWaaWbaaSqabeaacaaIYaaaaOGaaiilaaaa@4C9D@

which is positive if and only if

λ > 2 1 | i I f j | . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8GiVeY=Pipec8Eeeu0xXdbba9frFj0xb9Lqpepeea0xd9q8qiYRWxGi6xij=hbbc9s8aq0=yqpe0xbbG8A8frFve9Fve9Fj0dmeaabaqaciaacaGaaeqabaqabeGadaaakeaaiiGacqWF7oaBcqGH+aGpcaaIYaGaeyyXICDcfa4aaSaaaeaacaaIXaaabaWaaqWaaeaadaaeqaqaaiaadAgadaWgaaqaaiaadQgaaeqaaaqaaiaadMgacqGHiiIZceWGjbGbauaaaeqacqGHris5aaGaay5bSlaawIa7aaaakiaac6caaaa@4255@

This inequality provides a criterion for determining when the (more correct) three-segment solution will be preferred over the (too rigid) one-segment solution. The inequality states that, for the three-segment solution to be selectable, λ must exceed a bound that is inversely proportional to the sum of the f j in I'. The latter in turn is approximately proportional to the width of I' and the expectancy of f j (assuming that the f j are similarly distributed in I') on average.

This criterion can be used to identify reasonable λ values. First, the simplest segmentation result is a one-segment solution that spans the entire chromosome. This solution will be guaranteed to be tested for if λ1 = 0. Second, λ N specifies the most flexible model used. For this parameter, we used the value 2/5. This choice allows for the resolution of segments with |∑f j | around 5, a level that corresponds to, for example, a 5-probe segment with plateau level around 1.0, or a 10-probe segments with a plateau level around 0.5. Given the characteristics of the data (noisy, low genomic resolution and the presence of 'non-influenced' genes), we cannot hope to detect segments with very few probes, making this choice of λ N reasonable. In this context, we remark that if the aim is to detect individual differentially expressed genes, several dedicated methods are available for this purpose (for example, t statistic-based approaches). Third, it remains to select λ values between λ1 and λ N . It seems natural to select λ that correspond to equally, and sufficiently densely, spaced ∑f j . Taken together, these considerations motivate the series λ1 = 0, λ2 = 2/100, λ3 = 2/99, ..., λ N = 2/5, which was used both in the simulations and on real data.

Apparently, this series can be altered by changing λ N and the density of in-between values. We illustrate the effect of changing λ N by using two truncated series (λ N = 2/30 and λ N = 2/15) in the Results section. We also repeated the experiments with twice as dense and twice as sparse λ, yielding results in broad agreement with those presented (data not shown). The choice λ1 = 0 is not subject to tweaking, as we will always be interested in knowing whether the one-segment (whole-chromosome) solution is relevant.

Simulation model

In the simulation study, we generated artificial chromosomes by mixing known, piece-wise constant expression bias profiles with a randomly generated high-frequency signal component (corresponding to noise plus inherent variability in gene expression). Within the ith segment, we regard the f j as following the mixture distribution f j ~ π i N ( 0 , σ 2 ) + ( 1 π i ) N ( μ i , σ 2 ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2Caerbhv2BYDwAHbqedmvETj2BSbqee0evGueE0jxyaibaiKI8=vI8viVeY=Nipec8Eeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGaamOzamaaBaaaleaacaWGQbaabeaakiaac6haiiGacqWFapaCdaWgaaWcbaGaamyAaaqabaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGccqGFneVtcaGGOaGaaGimaiaacYcacqWFdpWCdaahaaWcbeqaaiaaikdaaaGccaGGPaGaey4kaSIaaiikaiaaigdacqGHsislcqWFapaCdaWgaaWcbaGaamyAaaqabaGccaGGPaGae4xdX7Kaaiikaiab=X7aTnaaBaaaleaacaWGPbaabeaakiaacYcacqWFdpWCdaahaaWcbeqaaiaaikdaaaGccaGGPaaaaa@56BA@ , where μ i is the plateau level, σ2 variance of the noise and variability in expression around the baseline and π i is the proportion of non-influenced genes, that is, the percentage of genes whose expression is not altered by the underlying genetic alteration. The reason for using a mixture distribution is to allow the model to accommodate for genes that are completely transcriptionally inactive or are targeted by 'bad' probes.

In the first two simulation experiments (ROC and breakpoint distributions), we used expression profiles with central square-wave step of varying width and height. In this case, the simulation model has four parameters: the chromosome length, the aberration width, the SNR and the proportion of non-influenced genes (π). For tractability, we assume the same proportion of non-influenced genes in all segments.

The parameter values were as follows. The chromosome length was fixed to 100. However, to verify robustness, the experiments were repeated with numerous other values, yielding results in agreement with those presented (data not shown). The aberration widths were 10, 20 or 40. The SNRs were 0.5, 1.0 and 2.0. Roughly, the first two values correspond to expression data-like conditions, whereas the last value corresponds to aCGH data-like conditions. The proportions of non-influenced genes were 0.0, 0.1, ..., 0.5, ranging from regions with few non-influenced genes to regions with large proportions of non-influenced genes. When π = 0.0, our simulation model is identical to that used in [24].

Performance assessment measures

To assess the performance of the different algorithms, we calculated ROC curves and breakpoint maps for all combinations of aberration widths, SNRs, and proportions of non-influenced genes. To generate ROC curves, we calculated the TPRs and the FPRs across 200 simulated chromosomes as we varied the threshold for determining the relevance of an aberration. TPRs were calculated as the number of genes inside the central (biased) region whose segmented values are above the threshold level divided by the number of genes in the aberration. FPRs were defined as the number of genes outside the central region whose segmented values are above the threshold level divided by the total number of genes outside the aberration. To compute the ROC and false discovery rate curves, we varied the threshold for calling regions relevant from zero to the maximum gene score. Each threshold value yields a TPR and a FPR, represented by a point on the ROC curve. As noted in [24], TPR and FPR are informative in understanding how an algorithm performs in estimating the boundary of the altered region: when the algorithm over-estimates the boundary, FPR increases while TPR remains fixed; when it under-estimates the boundary, TPR decreases while FPR remains fixed.

To generate breakpoint maps, we simulated and segmented 10,000 chromosomes. We then counted the number of breakpoints identified at each chromosomal position and, finally, normalized the resulting histogram by dividing the value in each bin by the total number of breakpoints.

Selection of parameter values in the control methods

When running the control methods DNAcopy and CGHseg, we used the default method parameters suggested in the original publications [22, 23]. The motivation for this decision is three-fold. First, the use of default parameters is in agreement with previous comparative reviews, in which default parameters are used throughout [24]. Second, it can be argued that default parameters produce a realistic test scenario, as these are the parameters many users would use in practice [24]. Third, and finally, it appears reasonable to expect that default parameters have been made default because they produce good results in many cases. For completeness, however, we performed complementary experiments in which we used a broad range of other method parameter values, distinct from the default settings. These experiments support that the default parameters are in fact an appropriate choice (exemplified in Additional file 5).

Microarray data and preprocessing

For testing, we used the data set by Ross et al [26] (obtained from [51]) containing expression profiles (Affymetrix U133A+B arrays) from patients with childhood ALL of different subtypes (Table 1). The expression values (log-scale) of each case were converted to z-scores with respect to all out-of-class cases, that is, for gene j in a given case, we let f j = (y j - m j )/s j , where y j is the expression value, m j the average expression value across cases whose classes differ from that of the case being analyzed and s j is the pooled within-class standard error given by Smyth's robust empirical Bayes estimator [52]. In principle, this type of data normalization is largely similar to the normalization performed when extracting lists of differentially expressed genes (by the use of t-statistics), although, in our case, we perform the normalization on a case-versus-group, rather than group-versus-group, basis.

The advantage of computing differential expression with respect to a pool of expression profiles from multiple tumor classes is that class-specific changes in expression will be diluted. In particular, we obtain a reference group that is approximately euploid on average, except in (hopefully uncommon) regions sharing copy number changes shared by all leukemic subtypes. We note that in cases when other tumor types are unavailable as controls, other relevant control samples can be used in their place. For instance, it may sometimes be natural to use expression profiles of normal tissue as reference profiles. We also note that σ2 ≈ 1 for all genes because of the definition of the z-score and the fact that most genes are non-differentially expressed between classes. This motivates the use of normal distributions with unit variance in the simulations.

In the experiments, we included the data set by Mullighan et al [29], consisting of DNA copy number profiles (Affymetrix 250 k SNP arrays) from the same types of tumors as those covered in the Ross et al data set. While the two data sets were produced by the same research group, the annotation provided does not allow copy number profiles to be paired with their corresponding expression profiles. Hence, the Mullighan et al and Ross et al data cannot be correlated case-by-case. However, by computing the average DNA copy number profile across each leukemic subtype, the Mullighan et al data could be used to obtain a map of common gains and losses of chromosomal material in specific ALL subtypes (see Results and Figure 5).

Software availability

The described method has been implemented as a software package (Rendersome), which is freely available on request from the authors.

Additional data files

Additional data file 1 is a complete set of ROC curves from the simulation study.

Additional data file 2 is a complete set of breakpoint distribution plots from the simulation study.

Additional data file 3 is a high-resolution versions of the expression maps for each of the ALL cases in the Ross et al data set, as reconstructed by the proposed algorithm.

Additional data file 4contains additional information about the proposed segmentation algorithms, including pseudocode.

Additional data file 5 contains additional data illustrating that the use of the default method parameters for CGHseg is appropriate.



array comparative genome hybridization


acute lymphoblastic leukemia


single nucleotide polymorphism


signal-to-noise ratio


total variance.


  1. Heidenblad M, Lindgren D, Veltman J, Jonson T, Mahlamaki E, Gorunova L, van Kessel A, Schoenmakers E, Hoglund M: Microarray analyses reveal strong influence of DNA copy number alterations on the transcriptional patterns in pancreatic cancer: implications for the interpretation of genomic amplifications. Oncogene. 2005, 24: 1794-1801. 10.1038/sj.onc.1208383.

    Article  PubMed  CAS  Google Scholar 

  2. Hertzberg L, Betts D, Raimondi S, Schafer B, Notterman D, Domany E, Izraeli S: Prediction of chromosomal aneuploidy from gene expression data. Genes Chromosomes Cancer. 2007, 46: 75-86. 10.1002/gcc.20391.

    Article  PubMed  CAS  Google Scholar 

  3. Hyman E, Kauraniemi P, Hautaniemi S, Wolf M, Mousses S, Rozenblum E, Ringner M, Sauter G, Monni O, Elkahloun A, Kallioniemi O, Kallioniemi A: Impact of DNA amplification on gene expression patterns in breast cancer. Cancer Res. 2002, 62: 6240-6245.

    PubMed  CAS  Google Scholar 

  4. Masayesva B, Ha P, Garrett-Mayer E, Pilkington T, Mao R, Pevsner J, Speed T, Benoit N, Moon C, Sidransky D, Westra W, Califano J: Gene expression alterations over large chromosomal regions in cancers include multiple genes unrelated to malignant progression. Proc Natl Acad Sci USA. 2004, 101: 8715-8720. 10.1073/pnas.0400027101.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  5. Pollack J, de Rijn MV, Botstein D: Challenges in developing a molecular characterization of cancer. Semin Oncol. 2002, 29: 280-285. 10.1053/sonc.2002.32903.

    Article  PubMed  CAS  Google Scholar 

  6. Pollack J, Sorlie T, Perou C, Rees C, Jeffrey S, Lonning P, Tibshirani R, Botstein D, Borresen-Dale A, Brown P: Microarray analysis reveals a major direct role of DNA copy number alteration in the transcriptional program of human breast tumors. Proc Natl Acad Sci USA. 2002, 99: 12963-12968. 10.1073/pnas.162471999.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  7. Reyal F, Stransky N, Bernard-Pierrot I, Vincent-Salomon A, de Rycke Y, Elvin P, Cassidy A, Graham A, Spraggon C, Desille Y, Fourquet A, Nos C, Pouillart P, Magdelenat H, Stoppa-Lyonnet D, Couturier J, Sigal-Zafrani B, Asselain B, Sastre-Garau X, Delattre O, Thiery J, Radvanyi F: Visualizing chromosomes as transcriptome correlation maps: evidence of chromosomal domains containing co-expressed genes - a study of 130 invasive ductal breast carcinomas. Cancer Res. 2005, 65: 1376-1383. 10.1158/0008-5472.CAN-04-2706.

    Article  PubMed  CAS  Google Scholar 

  8. Schoch C, Kohlmann A, Dugas M, Kern W, Hiddemann W, Schnittger S, Haferlach T: Genomic gains and losses influence expression levels of genes located within the affected regions: a study on acute myeloid leukemias with trisomy 8, 11, or 13, monosomy 7, or deletion 5q. Leukemia. 2005, 19: 1224-1228. 10.1038/sj.leu.2403810.

    Article  PubMed  CAS  Google Scholar 

  9. Schoch C, Kohlmann A, Dugas M, Kern W, Schnittger S, Haferlach T: Impact of trisomy 8 on expression of genes located on chromosome 8 in different AML subgroups. Genes Chromosomes Cancer. 2006, 45: 1164-1168. 10.1002/gcc.20380.

    Article  PubMed  CAS  Google Scholar 

  10. Tsafrir D, Bacolod M, Selvanayagam Z, Tsafrir I, Shia J, Zeng Z, Liu H, Krier C, Stengel R, Barany F, Gerald W, Paty P, Domany E, Notterman D: Relationship of gene expression and chromosomal abnormalities in colorectal cancer. Cancer Res. 2006, 66: 2129-2137. 10.1158/0008-5472.CAN-05-2569.

    Article  PubMed  CAS  Google Scholar 

  11. Wang Q, Diskin S, Rappaport E, Attiyeh E, Mosse Y, Shue D, Seiser E, Jagannathan J, Shusterman S, Bansal M, Khazi D, Winter C, Okawa E, Grant G, Cnaan A, Zhao H, Cheung N, Gerald W, London W, Matthay K, Brodeur G, Maris J: Integrative genomics identifies distinct molecular classes of neuroblastoma and shows that multiple genes are targeted by regional alterations in DNA copy number. Cancer Res. 2006, 66: 6050-6062. 10.1158/0008-5472.CAN-05-4618.

    Article  PubMed  CAS  Google Scholar 

  12. Crawley J, Furge K: Identification of frequent cytogenetic aberrations in hepatocellular carcinoma using gene-expression microarray data. Genome Biol. 2002, 3: RESEARCH0075-10.1186/gb-2002-3-12-research0075.

    Article  PubMed  PubMed Central  Google Scholar 

  13. Zhou Y, Luoh S, Zhang Y, Watanabe C, Wu T, Ostland M, Wood W, Zhang Z: Genome-wide identification of chromosomal regions of increased tumor expression by transcriptome analysis. Cancer Res. 2003, 63: 5781-5784.

    PubMed  CAS  Google Scholar 

  14. Kano M, Nishimura K, Ishikawa S, Tsutsumi S, Hirota K, Hirose M, Aburatani H: Expression imbalance map: a new visualization method for detection of mRNA expression imbalance regions. Physiol Genomics. 2003, 13: 31-46.

    Article  PubMed  CAS  Google Scholar 

  15. Midorikawa Y, Tsutsumi S, Nishimura K, Kamimura N, Kano M, Sakamoto H, Makuuchi M, Aburatani H: Distinct chromosomal bias of gene expression signatures in the progression of hepatocellular carcinoma. Cancer Res. 2004, 64: 7263-7270. 10.1158/0008-5472.CAN-04-1275.

    Article  PubMed  CAS  Google Scholar 

  16. Furge K, Dykema K, Ho C, Chen X: Comparison of array-based comparative genomic hybridization with gene expression-based regional expression biases to identify genetic abnormalities in hepatocellular carcinoma. BMC Genomics. 2005, 6: 67-10.1186/1471-2164-6-67.

    Article  PubMed  PubMed Central  Google Scholar 

  17. Yang X, Tan M, Kim H, Ditlev J, Betten M, Png C, Kort E, Futami K, Furge K, Takahashi M, Kanayama H, Tan P, Teh B, Luan C, Wang K, Pins M, Tretiakova M, Anema J, Kahnoski R, Nicol T, Stadler W, Vogelzang N, Amato R, Seligson D, Figlin R, Belldegrun A, Rogers C, Teh B: A molecular classification of papillary renal cell carcinoma. Cancer Res. 2005, 65: 5628-5637. 10.1158/0008-5472.CAN-05-0533.

    Article  PubMed  CAS  Google Scholar 

  18. Frigola J, Song J, Stirzaker C, Hinshelwood R, Peinado M, Clark S: Epigenetic remodeling in colorectal cancer results in coordinate gene suppression across an entire chromosome band. Nat Genet. 2006, 38: 540-549. 10.1038/ng1781.

    Article  PubMed  CAS  Google Scholar 

  19. Stransky N, Vallot C, Reyal F, Bernard-Pierrot I, de Medina S, Segraves R, de Rycke Y, Elvin P, Cassidy A, Spraggon C, Graham A, Southgate J, Asselain B, Allory Y, Abbou C, Albertson D, Thiery J, Chopin D, Pinkel D, Radvanyi F: Regional copy number-independent deregulation of transcription in cancer. Nat Genet. 2006, 38: 1386-1396. 10.1038/ng1923.

    Article  PubMed  CAS  Google Scholar 

  20. Lilljebjörn H, Heidenblad M, Nilsson B, Lassen C, Horvat A, Heldrup J, Behrendtz M, Johansson B, Andersson A, Fioretos T: Combined high resolution array-based comparative genomic hybridization and expression profiling of ETV6/RUNX1-positive acute lymphoblastic leukaemia reveal a high incidence of cryptic Xq duplications and identify several putative target genes. Leukemia. 2007, 21: 2137-2144. 10.1038/sj.leu.2404879.

    Article  PubMed  Google Scholar 

  21. Rudin L, Osher S, Fatemi E: Nonlinear total variation based noise removal algorithms. Physica D. 1992, 60: 259-268. 10.1016/0167-2789(92)90242-F.

    Article  Google Scholar 

  22. Picard F, Robin S, Lavielle M, Vaisse C, Daudin J: A statistical approach for array CGH data analysis. BMC Bioinformatics. 2005, 6: 27-10.1186/1471-2105-6-27.

    Article  PubMed  PubMed Central  Google Scholar 

  23. Olshen A, Venkatraman E, Lucito R, Wigler M: Circular binary segmentation for the analysis of array-based DNA copy number data. Biostatistics. 2004, 5: 557-572. 10.1093/biostatistics/kxh008.

    Article  PubMed  Google Scholar 

  24. Lai W, Johnson M, Kucherlapati R, Park P: Comparative analysis of algorithms for identifying amplifications and deletions in array CGH data. Bioinformatics. 2005, 21: 3763-3770. 10.1093/bioinformatics/bti611.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  25. Willenbrock H, Fridlyand J: A comparison study: applying segmentation to array CGH data for downstream analyses. Bioinformatics. 2005, 21: 4084-4091. 10.1093/bioinformatics/bti677.

    Article  PubMed  CAS  Google Scholar 

  26. Ross M, Zhou X, Song G, Shurtleff S, Girtman K, Williams W, Liu H, Mahfouz R, Raimondi S, Lenny N, Patel A, Downing J: Classification of pediatric acute lymphoblastic leukemia by gene expression profiling. Blood. 2003, 102: 2951-2959. 10.1182/blood-2003-01-0338.

    Article  PubMed  CAS  Google Scholar 

  27. Jaffe E, Harris N, Stein H, Vardiman J, (Eds): World Health Organization Classification of Tumors: Pathology and Genetics of Tumours of Haematopoietic and Lymphoid Tissues. 2001, Paris: IARC Press

    Google Scholar 

  28. Mitelman F, Johansson B, Mertens F: Database of chromosome aberrations in cancer. 2007, []

    Google Scholar 

  29. Mullighan C, Goorha S, Radtke I, Miller C, Coustan-Smith E, Dalton J, Girtman K, Mathew S, Ma J, Pounds S, Su X, Pui C, Relling M, Evans W, Shurtleff S, Downing J: Genome-wide analysis of genetic alterations in acute lymphoblastic leukaemia. Nature. 2007, 446: 758-764. 10.1038/nature05690.

    Article  PubMed  CAS  Google Scholar 

  30. Paulsson K, Horvat A, Fioretos T, Mitelman F, Johansson B: Formation of der(19)t(1;19)(q23;p13) in acute lymphoblastic leukemia. Genes Chromosomes Cancer. 2005, 42: 144-148. 10.1002/gcc.20133.

    Article  PubMed  CAS  Google Scholar 

  31. Yin W, Chen T, Zhou S, Chakraborty A: Background correction for cDNA microarray images using the TV+L1 model. Bioinformatics. 2005, 21: 2410-2416. 10.1093/bioinformatics/bti341.

    Article  PubMed  CAS  Google Scholar 

  32. Autio R, Hautaniemi S, Kauraniemi P, Yli-Harja O, Astola J, Wolf M, Kallioniemi A: CGH-Plotter: MATLAB toolbox for CGH-data analysis. Bioinformatics. 2003, 19: 1714-1715. 10.1093/bioinformatics/btg230.

    Article  PubMed  CAS  Google Scholar 

  33. Daruwala R, Rudra A, Ostrer H, Lucito R, Wigler M, Mishra B: A versatile statistical analysis algorithm to detect genome copy number variation. Proc Natl Acad Sci USA. 2004, 101: 16292-16297. 10.1073/pnas.0407247101.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  34. Price T, Regan R, Mott R, Hedman A, Honey B, Daniels R, Smith L, Greenfield A, Tiganescu A, Buckle V, Ventress N, Ayyub H, Salhan A, Pedraza-Diaz S, Broxholme J, Ragoussis J, Higgs D, Flint J, Knight S: SW-ARRAY: a dynamic programming solution for the identification of copy-number changes in genomic DNA using array comparative genome hybridization data. Nucleic Acids Res. 2005, 33: 3455-3464. 10.1093/nar/gki643.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  35. Fridlyand J, Snijders A, Pinkel D, Albertson D, Jain A: Hidden Markov models approach to the analysis of array CGH data. J Multivar Anal. 2004, 90: 132-153. 10.1016/j.jmva.2004.02.008.

    Article  Google Scholar 

  36. Marioni J, Thorne N, Tavare S: BioHMM: a heterogeneous hidden Markov model for segmenting array CGH data. Bioinformatics. 2006, 22: 1144-1146. 10.1093/bioinformatics/btl089.

    Article  PubMed  CAS  Google Scholar 

  37. Shah S, Xuan X, DeLeeuw R, Khojasteh M, Lam W, Ng R, Murphy K: Integrating copy number polymorphisms into array CGH analysis using a robust HMM. Bioinformatics. 2006, 22: e431-e439. 10.1093/bioinformatics/btl238.

    Article  PubMed  CAS  Google Scholar 

  38. Hupe P, Stransky N, Thiery J, Radvanyi F, Barillot E: Analysis of array CGH data: from signal ratio to gain and loss of DNA regions. Bioinformatics. 2004, 20: 3413-3422. 10.1093/bioinformatics/bth418.

    Article  PubMed  CAS  Google Scholar 

  39. Myers C, Dunham M, Kung S, Troyanskaya O: Accurate detection of aneuploidies in array CGH and gene expression microarray data. Bioinformatics. 2004, 20: 3533-3543. 10.1093/bioinformatics/bth440.

    Article  PubMed  CAS  Google Scholar 

  40. Wang P, Kim Y, Pollack J, Narasimhan B, Tibshirani R: A method for calling gains and losses in array CGH data. Biostatistics. 2005, 6: 45-58. 10.1093/biostatistics/kxh017.

    Article  PubMed  Google Scholar 

  41. Callegaro A, Basso D, Bicciato S: A locally adaptive statistical procedure (LAP) to identify differentially expressed chromosomal regions. Bioinformatics. 2006, 22: 2658-2666. 10.1093/bioinformatics/btl455.

    Article  PubMed  CAS  Google Scholar 

  42. Caron H, van Schaik B, van der Mee M, Baas F, Riggins G, van Sluis P, Hermus M, van Asperen R, Boon K, Voute P, Heisterkamp S, van Kampen A, Versteeg R: The human transcriptome map: clustering of highly expressed genes in chromosomal domains. Science. 2001, 291: 1289-1292. 10.1126/science.1056794.

    Article  PubMed  CAS  Google Scholar 

  43. Eilers P, de Menezes R: Quantile smoothing of array CGH data. Bioinformatics. 2005, 21: 1146-1153. 10.1093/bioinformatics/bti148.

    Article  PubMed  CAS  Google Scholar 

  44. Hodgson G, Hager J, Volik S, Hariono S, Wernick M, Moore D, Nowak N, Albertson D, Pinkel D, Collins C, Hanahan D, Gray J: Genome scanning with array CGH delineates regional alterations in mouse islet carcinomas. Nat Genet. 2001, 29: 459-464. 10.1038/ng771.

    Article  PubMed  CAS  Google Scholar 

  45. Hsu L, Self S, Grove D, Randolph T, Wang K, Delrow J, Loo L, Porter P: Denoising array-based comparative genomic hybridization data using wavelets. Biostatistics. 2005, 6: 211-226. 10.1093/biostatistics/kxi004.

    Article  PubMed  Google Scholar 

  46. Levin A, Ghosh D, Cho K, Kardia S: A model-based scan statistic for identifying extreme chromosomal regions of gene expression in human tumors. Bioinformatics. 2005, 21: 2867-2874. 10.1093/bioinformatics/bti417.

    Article  PubMed  CAS  Google Scholar 

  47. Toedling J, Schmeier S, Heinig M, Georgi B, Roepcke S: MACAT - microarray chromosome analysis tool. Bioinformatics. 2005, 21: 2112-2113. 10.1093/bioinformatics/bti183.

    Article  PubMed  CAS  Google Scholar 

  48. Versteeg R, van Schaik B, van Batenburg M, Roos M, Monajemi R, Caron H, Bussemaker H, van Kampen A: The human transcriptome map reveals extremes in gene density, intron length, GC content, and repeat pattern for domains of highly and weakly expressed genes. Genome Res. 2003, 13: 1998-2004. 10.1101/gr.1649303.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  49. Alvarez L, Mazorra L: Signal and image reatoration using shock filters and anisotropic diffusion. SIAM J Numer Anal. 1994, 31: 590-605. 10.1137/0731032.

    Article  Google Scholar 

  50. Bellman R: Dynamic Programming. 1957, Princeton, NJ: Princeton University Press

    Google Scholar 

  51. St Jude Children's Research Hospital website. []

  52. Smyth G: Linear models and empirical Bayes methods for assessing differential expression in microarray experiments. Stat Appl Genet Mol Biol. 2004, 3: Article 3-

    Google Scholar 

Download references


This work was supported by research grants from the Swedish Cancer Society, the Swedish Children's Cancer Foundation, and the Medical Faculty of Lund University.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Björn Nilsson.

Additional information

Authors' contributions

BN developed the algorithm, designed and performed the experiments and wrote the manuscript. MJ participated in designing the algorithm and co-authored the manuscript. AH, SN and TF oversaw the experiments and co-authored the manuscript. All authors read and approved the final version of the manuscript.

Electronic supplementary material

Additional file 1: Complete set of ROC curves from the simulation study (PDF 131 KB)

Additional file 2: Complete set of breakpoint distribution plots from the simulation study (PDF 149 KB)


Additional file 3: High-resolution versions of the expression maps for each of the ALL cases in the Ross et al data set, as reconstructed by the proposed algorithm. Gray: Original gene scores from the Ross data set. Blue solid: Segmented gene scores. Each row represents one case, except for the bottom row which displays the average segmentation result and DNA copy number profiles (orange) across each leukemic subtype. (RAR 6 MB)

Additional file 4: Additional information about the proposed segmentation algorithms, including pseudocode. (PDF 40 KB)


Additional file 5: Additional data illustrating that the use of the default method parameters for CGHseg is appropriate. (PDF 134 KB)

Authors’ original submitted files for images

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nilsson, B., Johansson, M., Heyden, A. et al. An improved method for detecting and delineating genomic regions with altered gene expression in cancer. Genome Biol 9, R13 (2008).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: