- Research article
- Open Access

# Improvements to previous algorithms to predict gene structure and isoform concentrations using Affymetrix Exon arrays

- Miguel A Anton
^{1}, - Ander Aramburu
^{1}and - Angel Rubio
^{1}Email author

**11**:578

https://doi.org/10.1186/1471-2105-11-578

© Anton et al; licensee BioMed Central Ltd. 2010

**Received: **22 April 2010

**Accepted: **26 November 2010

**Published: **26 November 2010

## Abstract

### Background

Exon arrays provide a way to measure the expression of different isoforms of genes in an organism. Most of the procedures to deal with these arrays are focused on gene expression or on exon expression. Although the only biological analytes that can be properly assigned a concentration are transcripts, there are very few algorithms that focus on them. The reason is that previously developed summarization methods do not work well if applied to transcripts. In addition, gene structure prediction, i.e., the correspondence between probes and novel isoforms, is a field which is still unexplored.

### Results

We have modified and adapted a previous algorithm to take advantage of the special characteristics of the Affymetrix exon arrays. The structure and concentration of transcripts -some of them possibly unknown- in microarray experiments were predicted using this algorithm. Simulations showed that the suggested modifications improved both specificity (SP) and sensitivity (ST) of the predictions. The algorithm was also applied to different real datasets showing its effectiveness and the concordance with PCR validated results.

### Conclusions

The proposed algorithm shows a substantial improvement in the performance over the previous version. This improvement is mainly due to the exploitation of the redundancy of the Affymetrix exon arrays. An R-Package of SPACE with the updated algorithms have been developed and is freely available.

## Keywords

- Alternative Splice
- Singular Value Decomposition
- Probe Intensity
- Alternative Splice Event
- Exon Array

## Background

Alternative splicing (AS) is the process by which a single gene is able to express several proteins that may have diverse or even antagonistic functions. The mature mRNA that corresponds to the different proteins for the same gene is called transcript isoform or isoform in short. Some AS is related to development, tissue differentiation, etc. Other AS events are pathological and are associated with various diseases including cancer. Many of them are yet unknown. The analysis of disease specific alternative splicing and its molecular consequences is promising and can be used to find new diagnostic, prognostic, predictive, and therapeutic tools [1].

Some microarray companies (Affymetrix, Jivan Biotechnology and Exonhit) provide arrays designed to capture alternative splicing events. There are also custom arrays that use the Agilent platform [2]. The main difference between these technologies is that Affymetrix only includes exon probes (complementary sequences to each one of the known transcribed exons of a given gene) and Jivan, Exonhit or customized Agilent arrays also include junction probes (a segment of complementary nucleotides for each of the two sides of a known exon-exon junction in the mature mRNA of the gene). Affymetrix has recently developed an experimental array that also includes junction probes. This work focuses on Affymetrix exon arrays. There are a number of studies that propose different methods to deal with these arrays [2–8]. The procedure to extract a signal value from a set of probes in an Affymetrix array (including exon arrays) can be divided into three stages: background removal, normalization (to equalize the conditions among all the experiments) and summarization (to provide a single concentration measurement that represents all the signals in a set of probes that corresponds to a particular analyte). Usually the proposed methods for exon arrays [9, 10] are modifications of the algorithms already used in expression arrays.

Algorithms for removing background and performing normalization in expression arrays can be reasonably applied to exon arrays. However, the summarization step has some special characteristics that make it difficult to apply these methods. To clarify this assertion, it is important to distinguish that, in exon arrays, there are three ways to group the probes: by genes (to measure gene expression), by transcripts (to measure transcript expressions) and by exons (to measure the exon expression). Affymetrix [11] and Brainarray [12] provide different updated versions of the Chip Definition Files (CDF) to do the grouping using genes, transcripts or exons and using different identifiers for each of them. Our work focuses on transcripts.

In a summarization step it is implicitly assumed that there is no cross-hybridization between probes that belong to different sets (or at least in most of the probes). However, if the probes are grouped by transcripts and a gene presents several isoforms, there will be many probes that hybridize with several transcripts of the same gene. To make matters worse, specific probes for a particular transcript (that do not show cross-hybridization) may be excluded if the computation is a robust summarization method. The reason is that, since their behavior is different from other probes in the set, their values are not used in the summarized signal. As many as 85% of the exons in genes with several isoforms are shared by several transcripts. It is not advisable to use standard expression algorithms to exon arrays grouped by transcripts. In the seminal study of Wang *et al*. [13] this problem is stated and solved by using a deconvolution algorithm assuming that the structure of the gene is known. Recently, a work that also deals with transcript concentration estimation has been proposed [14]. For some gene structures there is a deconvolution ambiguity and additional constrains may be necessary to resolve transcript expressions [15, 16].

To deal with the problem of quantifying transcripts, the authors and some colleagues [17] designed the algorithm "Splicing Prediction and Concentration Estimation" (SPACE) based on Non-negative Matrix Factorization (NMF). SPACE algorithm was used to predict the structure for each particular gene and quantify the concentration of each particular transcript including unknown isoforms. SPACE was designed to be used with arrays with either exon or junction probes. The special characteristics of the Affymetrix arrays drove us to include some refinements to this algorithm. They are (1) detection and removal of the outliers in the probe data, (2) estimation of the number of transcripts of a gene in a set of samples, (3) selection among the possible solutions which is the most suitable for splicing data (NMF solution is not unique) and (4) use of the information of probesets to correct errors in the predicted structure of the genes. In the results section, the improvements for simulated data are shown. The accuracy of predicted structures and concentrations validated by PCR for real datasets is also tested. In addition to this, the SPACE algorithm with the improvements described here, has been ported to R (initially it was written in Matlab).

## Results and Discussion

The improvements described in the methods section to the initial SPACE algorithm were applied to both synthetic and real microarray datasets. Each of the datasets are described in the following sections.

### Synthetic dataset

Around 600 genes (selected randomly) that show alternative splicing were simulated. Probe signals for this synthetic dataset are proportional to the sum of concentrations of the transcripts that share the probe, in turn, this proportional constant, the affinity, was estimated from the values of each probe in an experiment for different tissues provided by Affymetrix. These affinities are estimated using dChip. This method assumes that the signal is proportional to the product of the affinities of the probes and the concentration of the gene. Once the estimated concentration of the gene is known it is quite straightforward to get the affinities. Another equivalent possibility is to get the affinities using the first eigenvector of the SVD decomposition of the probe data matrix for each gene. Since dChip assumes that there is only one isoform per gene, these affinities are not accurate but sufficient to perform a simulation. Transcript concentrations are constructed by drawing random numbers that follow a uniform distribution across samples and multiplying them by a proportional factor also drawn from a uniform distribution. This approach simulates that there are some transcripts that are systematically more expressed than others in a gene.

The property *G* matrix for each of the genes was built using the information provided by Brainarray [12]. *G* is an indicial matrix (*g*_{
ij
} = {0, 1}) that relates probes with transcripts, i.e. it discerns whether a probe is included in a transcript or not. The size of this matrix is *probes transcripts*. Following the deconvolution model proposed by Wang *et al*. [13], the simulated probe signal matrix (*probes samples*) was built by multiplying the three matrices (*Y* = *A⋯G⋯T*). The underlying reasoning is that the signal of each probe is proportional to its affinity times the sum of the concentrations of the transcripts that hybridizes against it. Finally, noise (both multiplicative and additive) was added. This noise was computed so that it is similar to the noise present in real data. In turn, the noise in real data was estimated by using the residuals of the dChip summarization model.

This simulated dataset are 600 genes with known structure (obtained from Brainarray), known number of transcripts (consequence of the structure) and known concentrations (generated using random numbers) plus noise that mimics the real distribution.

The SPACE algorithm includes a NMF step. The NMF is computed iteratively. Each gene is iterated 3000 times to achieve convergence.

The results are presented for estimation of the number of different transcripts in a given mixture, structure prediction of each of these transcripts and estimation of their concentration.

#### Prediction of the number of transcripts

*Y*) into four submatrices and estimates one of these submatrices using the remaining three submatrices. Changing the role of each of the submatrices, it is possible to predict the whole initial data using approximately 75% of these data. The estimation is performed by means of using NMF (or partial SVD) and is done considering different internal dimensions for the factorizations into consideration. The estimation process was repeated a number of times for different partitions (250 in our case). Afterwards, we selected the minimal internal dimension of the factorization (number of transcripts) that provides an error distribution whose median is not statistically larger than the distribution of the error of the internal dimension with the minimum error (using a Wilcoxon test). Figure 1 shows the performance of this estimation. It compares the predicted number of transcripts (using only the simulated probe level data) with the number of transcripts in Ensembl (using Brainarray cdfs).

This simulation shows that the estimation of the number of transcripts is a difficult task even for synthetic data since, for this level of noise, the predicted number of transcripts is usually incorrect. Nevertheless, if the proposed method is used simply to predict splicing, it has a very low false positive rate (FPR), i.e. only 1% of the genes that have a single transcript are predicted to have alternative splicing. The false negative rate (genes with several transcripts that are predicted to have one transcript) is on average about 30%. This false negative rate (FNR) is (among others) a consequence of some simulated transcripts having very low concentrations in all samples, in comparison with the most significant transcript of the same gene. We also performed a simulation assuming that all the transcripts follow an uniform distribution and FNR improves (data not shown).

The Figure S3 in Additional file 1, compares the performance of the number of transcripts predictions using the new and the previous version of the algorithm on the same simulated dataset. The new version estimates the number of transcripts more accurately.

#### Structure prediction

SPACE algorithm was applied to each of the genes in the synthetic dataset. The algorithm provided a continuous estimation $\tilde{G}$ of the property *G* matrix (see methods section).

The $\tilde{G}$ matrix has all its values bounded between zero and one. On the other hand, the original *G* matrix is binary (i.e. a probe does or does not hybridize against a transcript). It would be desirable to quantify the ability to predict the *G* matrix using $\tilde{G}$.

Changing a threshold *th*, it is assumed that a particular entry of $\tilde{G}$ is 1 (the probe is predicted to hybridize against a particular transcript if the corresponding entry is over *th*) or 0 (the probe is predicted not to hybridize against this particular transcript if the corresponding entry is below *th*). Comparing the corresponding entries from *G* and ($\tilde{G}$ > *th*), there are true positives (TP, corresponding entry is 1 in both matrixes), true negatives (TN, the entry is 0 in both matrixes), false positives (FP, the entry is 0 in *G* and $\tilde{G}$ is over *th*) and false negatives (FN, the entry is 1 in *G* and $\tilde{G}$ is below *th*). These values (using different thresholds) can be used to construct the ROC or compute other performance figures. Each gene has its own ROC curve. Summing up each of TP, TN, FP and FN for all the genes it is possible to get an estimation of the overall performance.

It is important to point out that there is always an indetermination in the order of the transcripts: the columns of *G* and $\tilde{G}$ for a perfect prediction can have a different order. Before performing the previous computations, $\tilde{G}$ is resorted so that it becomes more similar to *G*. The same sorting is applied to the rows of the concentrations matrix.

In figure 2, it can be observed that the optimum threshold for the Hamming distance (overall error) is about 0.5. The new algorithm has a lower hamming distance than previous one. If the threshold that provides the same sensitivity and specificity (the crossing point) is set, both the one and zero values have the same reliability. In this case, we consider accidental inclusion as equally undesirable as accidental exclusion of an exon. This threshold is close to 0.8. The sensitivity and specificity of SPACE in the crossing point is equal to 0.85; such value represents an error 25% lower than the crossing point for SPACE without any improvement.

#### Concentration estimation

We scaled the columns of the *W* matrix to make its structure more similar to *AG* matrices. This scaling, different for each of the columns of *W* is possible because of the non-uniqueness of the NMF. The initial SPACE algorithm included a heuristic to obtain a "filled" G matrix that is also used in the improved one before the scaling. The estimated concentrations of the transcripts with and without the adaptation of *W* matrix in SPACE were compared. In figure S4 in Additional file 1, the mean average error (MAE%) for different genes used in the simulations is shown. In that figure, it can be observed that adaptation improves the estimation of the concentrations. In most of the cases the diminution in the estimated error is statistically significant.

### Real datasets

SPACE was also applied to several datasets downloaded from GEO [19]. All of them have available CEL files to perform all the steps of the analysis and the corresponding papers include validation of the results using RT-PCR. These datasets are: Affymetrix sample dataset of human tissues. It contains 11 tissues with 3 replicates of each tissue along with several mixtures of three tissues (heart, testes and cerebellum). A recent study made by de la Grange *et al*. [8] includes RT-PCR validation for some genes in that dataset; GSE9385 [20] (a study of glial brain tumors in humans); GSE9372 [21] (a comparative study of the relationships between genotype and alternative splicing in humans); GSE11344 [22] (change in splicing patterns after PTB depletion in mice); and GSE8945 [23] (a study on the effect of the hnRNP L protein on alternative splicing).

The Table S1 in Additional file 2, summarizes the results of the predictions for each of the datasets. The table includes the following fields: dataset, gene, RT-PCR band according to Fast-DB, number of isoforms between primers using PCR, predicted number of isoforms between primers using SPACE, number of isoforms between primers according to Ensembl 51, predicted total number of isoforms, total number of isoforms in Ensembl 51, coherence of predicted structure with PCRs, coherence of estimated concentrations with PCRs and a comment of the results.

#### Affymetrix dataset

*et al*. [8] a total of 17 genes that present alternative splicing between tissues were validated by RT-PCR (some of them in more than one splicing event). Two genes SNX13 and IDE were excluded because alternative splicing events shown in the PCRs do not appear in Ensembl release 51. Assuming that the gene structures of the remaining 15 genes in Ensembl are correct, we use these structures for each gene as "ground truth" and computed the ROC curves shown in Figure 3. The number of transcripts of each gene in all samples was estimated from the PCR figures. The number of transcripts was also estimated by the proposed algorithm. The estimated number of transcripts was usually larger than the indicated by PCRs. Two ROC curves were constructed. The red ROC curve indicates SPACE performance without any improvement. The black ROC curve was estimated applying the improvements described in the methods section.

*et al*. [8]. Results for other genes in [8] (and all the other studies) are shown in the additional material (Additional file 1).

#### Glial tumors

*et al*. [20], the authors provide PCRs for 11 genes. The analysis for ATP2B4 gene is shown in Figure 5. SPACE algorithm was run to predict the structure of two isoforms. Their predicted structure in panel (g) shows a cassette event that involves one exon towards the 5' end of the gene. The estimated concentrations of both transcripts (variant 1 and 2) across all samples are shown in panel (h). Variant 1 (short isoform) is almost non-existent in samples 1 to 6 (normal tissue). In samples 7 to 32 (oligodendroglioma), variant 2 has a larger concentration than variant 1. In samples 33 to 55 (glioblastoma multiforme), this difference in concentration is even more apparent. These results are not consistent with the PCRs shown in [20]. In this study, the PCR shows that the long isoform is expressed only in GBM cells whereas the short isoform is expressed similarly in the three groups. This error in the predicted concentration may be owed to the lack of identifiability of this particular gene structure [15, 16].

#### Genotype and alternative splicing

*et al*. [21] study, shows an alternative splicing event related to a particular SNP in probeset 3527423. In Ensembl release 51, this gene is annotated as a single transcript. Two transcripts were predicted by SPACE algorithm and their predicted structure is shown in panel (g). Predicted transcript variant 1 is equal to the annotated transcript in Ensembl. Predicted transcript variant 2 shows the lack of probeset 3527423. In panel (h), the estimated concentrations of the two predicted transcripts are shown. There are three replicates of each sample and the estimated concentrations match perfectly PCR results for both splicing variants in each sample.

In this particular case, the coherence algorithm would miss this alternative splicing event because the Ensembl annotation does not include this variant.

#### PTB depletion in mice

*et al*. [22], the obtained results for Ncam1 gene are shown in Figure 7. This gene has five different transcripts annotated in Ensembl release 51 as shown in panel (f), two of which are very short compared to the length of the gene. Two transcripts were predicted by SPACE and their predicted structure is shown in panel (g). The first predicted transcript variant 1 is very similar to the first Ensembl transcript. The second predicted transcript variant 2 is also similar to the third Ensembl transcript. Some probes that belong only to the short Ensembl transcripts are incorrectly assigned to the larger predicted transcripts and the second exon is also misassigned to the predicted variant 2. In panel (h), the estimated concentrations of the two predicted variants are shown. Variant 1 is predominant in the samples 1 to 3 (normal tissue) and variant 2 is predominant in the samples 4 to 6 (tissue of mice with PTB depletion). These concentrations are in concordance with PCRs.

### Discussion

We have described the different improvements on SPACE: outlier detection and correction; prediction of the number of transcripts; the adaptation of the factors of the NMF to provide a structure closer to the reality; and the exploitation of the redundancy of the Affymetrix probes.

All the improvements were tested on synthetic data mimicking the real data (affinity, structure and noise were taken from real data). Suggested changes improved error rates by about 25%. We have also tested our algorithms in RT-PCR validated data. The ROC figures document a specificity and sensitivity of around 75% in the case of structure prediction. Concentration estimates to a large extent mirrored PCR images in the cited studies.

However, when applying SPACE (with the suggested improvements) to real data we faced some problems worth noting. For example, SPACE algorithm assumes that all the probes hybridize against at least one of the transcripts. In exon arrays there are many probes (probes related with erroneously predicted exons) that do not hybridize against mRNA, this happens even in the core annotated probes. Additionally, many of the probes in exon arrays do not perform well or at least there are probes within the same exon that do not correlate well with other probes of that exon.

Structure prediction improves with careful selection of the probes, e.g. by identifying and discarding probes that do not hybridize or that cross-hybridize to different parts of the genome (a problem addressed by Kapur *et al*. [24]). Background acts as an offset for the probes in the array. Even though the applied background removal algorithm [25] behaves better than the standard RMA version, further improvements can be made at this point. This problem is attenuated but not completely solved when using Brainarray [12] CDF files for genes, transcripts and exons. There are several papers [4, 22, 24] that address these questions and provide different methods to select the probes.

Assessment of the performance of the SPACE algorithm for real datasets required some sort of "ground truth". In this paper, only genes with RT-PCR validated splicing events in each dataset were used for validation. It should be noted that PCRs only assess splicing events that appear between the primers, while SPACE algorithm reconstructs the whole structure of each transcript. For the validated gene set, transcript structures from Ensembl release 51 were used as reference. Inaccuracies in the Ensembl annotation would lead to an underestimation of the validation rates. In Figures S1 and S2, Additional file 1, the concordance between SPACE predictions and Ensembl release 51 annotations was tested for a set of 1600 randomly selected genes. The performance decreased compared to genes that have RT-PCR evidence of alternative splicing. Additionally, the concordance of the estimated concentrations of each isoform in each sample with the PCRs shows the accuracy of the predictions.

The redundancy of the Affymetrix probes in exon arrays was exploited to detect and correct errors in the structure. Probes that belong to the same exon or probeset (in the case of exons that differ between transcripts) must all be present or absent in a particular transcript. After applying this correction, both sensitivity and specificity improved significantly in real and simulated datasets. However, if a new transcript had a splicing event (previously unknown) that did not follow the probeset grouping (a new alternative donor site, for example), the prediction would be incorrect, as the algorithm would treat the probeset as a whole.

Variability between samples provides SPACE algorithm with more information that leads to better results in the prediction of structure. For example, a normal vs tumor experiment that consists of several technical replicates of the same samples provides less information than an experiment with 11 different tissues as the Affymetrix sample dataset. Additionally, the number of transcripts present in all samples is also important to the algorithm performance. If there are more than 4 or 5 transcripts SPACE performance greatly decreases.

Using the Wang deconvolution model, it would be possible to estimate transcript concentrations provided that the gene structure (*G* matrix) is known. However, there is a deconvolution ambiguity that only depends on the gene structure [15, 16]. This ambiguity may provide different valid solutions to the Wang model for some genes with the same probe intensities. SPACE is also sensitive to this ambiguity. However, as shown in the simulations, it is able to predict the structure and estimate the concentrations with reasonable accuracy. She *et al*. [15] suggest a method to deal with this ambiguity by estimating the mean affinity of groups of probes. This is a priori information which can also be included in the SPACE algorithm. It is also possible to test later whether the estimated *G* matrix has this ambiguity or not.

All the described algorithms have been included in an R-Package and added as the Additional file 3. A script to test the functions is also included as Additional file 4. The source code and the manual of the package are included as Additional file 5 and Additional file 6 respectively.

## Conclusions

We have proposed a method to predict the structure and estimate the concentration of transcripts using Affymetrix exon arrays. We have included several improvements over our previous work, namely; outlier identification and removal, improved estimations of the number of transcripts, adaptation of the NMF factors to mimic the proposed model and exploitation of the redundancy of the exon arrays that include several probes per exon. Simulations show that the error figures improved by applying these methods. The algorithms have been validated in real datasets.

## Methods

*W*matrix (Adapt algorithm) and structure correction by coherence.

### Normalization and background removal

The Robust Multiple-array Average (RMA) [26] procedures for background removal and quantile normalization were used. Instead of using the standard RMA background method, we used [25] (developed by the same group), an improvement over the previous algorithm. These methods are quick and efficient and can be readily applied to exon arrays. The implementation of these algorithms in aroma.affymetrix [27, 28] was used.

### Outlier detection and correction

Usually there are outliers within probe intensity data. An outlier is an anomalous probe measurement that shows an abnormal distance from similar probe measurements of the same array in different experiments after the normalization step. NMF factorization (the core of the SPACE algorithm) is not robust if there are outliers in data, as it tries to accommodate them. A single factor of the factorization may be used simply to store a large outlier. Therefore, results improve by removing outliers prior to the factorization. A method to detect outliers that is closely related with the algorithm to estimate the number of transcripts was included and is explained below. Once the outliers are identified, there are different algorithms to impute their values (for a comparative review Barnett *et al*. [29]).

### Making microarray intensity data homoscedastic

NMF optimization assumes that the residuals between the initial matrix and the estimated one by the factorization are homoscedastic, i.e. that the residuals have the same variance and do not depend on probe intensity or other variables. However, the residuals tend to be larger for probes with large affinities. Therefore, probe intensity matrix is rescaled to make the residuals closer to the proposed model.

Every probe intensity was divided by the median of the values of the same probe in all experiment raised to the power of 0.7. This value was obtained, using genes with a single transcript (according to Ensembl release 51) and comparing the residuals with the median of probe intensities. Using the aforementioned transformation, the prediction results in the simulation improved significantly.

### Estimation of the number of transcripts

The basic idea of the method is borrowed from Owen *et al*. [18]. This method provides an estimation of the optimal number of components to be retained using Singular Value Decomposition (SVD) or NMF data factorizations. The optimal number of components is computed by using a resampling method that splits the expression matrix of the probes belonging to a particular gene across all samples into four submatrices. Next, each submatrix is estimated using the other three submatrices. The suggested optimal number of components is the one with a smaller average error (after performing a number of estimations) compared to the initial matrix.

*Y*is split into four submatrices.

*k*=

*rank*(

*Y*) is smaller than

*min*(

*m*

_{1,}

*m*

_{2,}

*n*

_{1,}

*n*

_{2}), and

*rank*(

*Y*) =

*rank*(

*S*) then it can be demonstrated that the

*P*submatrix can be reconstructed using the other three submatrices. Without noise, the rank of

*Y*matrix is equal (or smaller in some degenerated cases) to the number of transcripts

*k*which represents the dimension of NMF factorization. In this case, the

*P*submatrix is identically,

*m*=

*m*

_{1}+

*m*

_{2},

*n*=

*n*

_{1}+

*n*

_{2}and

*S*

^{+}is the Moore-Penrose pseudoinverse of

*S*. If there is noise,

*rank*(

*Y*) ≠

*rank*(

*S*) and the reconstruction of

*P*will no longer be exact. This reconstruction is called $\tilde{P}$. In Owen

*et al*. [18], it is stated that using a partial pseudoinverse and only the

*k*first singular values of

*S*, the expected error of the reconstruction is minimized. This decomposition of matrix

*Y*can be done for any permutation

*L*of the initial matrix. In this case,

where ${S}_{k}^{+}$ is the pseudoinverse of *S* using the *k* first components. This consideration provides a way to apply resampling: using different factorizations, different estimates of *P* , *Q*, *R* and *S* and therefore, the whole *Y* matrix can be obtained. These permutations can be done for different values of *k*, i.e. the number of singular vectors to reconstruct *P* using the pseudoinverse of *S*. Owen *et al*. [18] suggest to select the *k* that provides the smallest expected value of the norm of the error, i.e.,

*k*increases the error drops until the optimum value. For larger values of

*k*the error increases only slightly. Our algorithm selects the optimal dimension by using the value of

*k*(number of transcripts) whose median error is not significantly different to the number of transcripts that provides the minimum error. The corresponding statistics are obtained using a Wilcoxon test.

A small variation of this algorithm was applied to detect the outliers in the data. Each of the *L* permutations provided a estimation for each entry of *Y* matrix using the largest possible *k*. Applying these estimations a number of times (250 in our case), a density function for each of the entries of the matrix is obtained. If an entry is far from the median of its distribution, it is considered to be an outlier and its value is substituted by the median of the estimates. This method takes (~5 sec/gene).

### Summarization

*et al*. [17]. Briefly, this method consists of applying non-negative matrix factorization (NMF) to the matrix of probe intensities. The standard NMF applied to the matrix

*Y*, yields two matrices

*W*and

*H*:

*W*can be used to reveal the predicted structure of the gene (whether a particular probe belongs to a transcript or not) and the second matrix

*H*the concentration of the transcripts. In Wang deconvolution model [13], the matrix equation is

*Y ≈ A·F·G·T*. The feature matrix

*F*and the property matrix

*G*were merged into a single matrix

*G*obtaining the following equation:

Comparing equation 4 and 5, it is possible to identify *W* with *A G* (the structure of the *k* transcripts) and *H* with *T* (their concentrations).

### Reshaping *W* to improve gene structure. Adapt algorithm

*D*and its inverse

*D*

^{-1}can be used to transform the two matrices as follows:

*AG*matrix,

This new factorization (given that $\tilde{W}$ and $\tilde{H}$ have all their elements non-negative) provides a different structure (and different concentrations) for each of the transcripts and reconstructs the same matrix. Since the reconstructed matrix is identical, any method to discern the "correct" *D* matrix must rely on additional properties of the data, not on the data themselves.

In our case, the non-negativity condition of $\tilde{W}$ and $\tilde{H}$ can be guaranteed if *D* is a non-negative diagonal matrix. Since the *G* matrix is binary (as proposed by Wang *et al*. [13]) and the *A* matrix is a diagonal of the affinities of the probes, all the rows in *AG* are equal to the affinity of the probe (if the probe hybridizes against the transcript) or zero (if the probe does not hybridize). There are many more probes that hybridize against transcripts than probes that do not, i.e., the *G* has many more ones than zeros. In Ensembl release 51 the median of the proportions of ones in all *G* matrices belonging to each gene is 83%. Taking these facts into account, we select the *D* matrix that provides a structure for $\tilde{W}$ that mimics the model, i.e. all the columns of $\tilde{W}$ must be similar to each other except a few probes.

*n*

_{ p }is the number of probes of a gene,

*n*

_{ t }is the number of transcripts and

*d*

_{ jj }are the elements of the diagonal of matrix

*D*. This optimization problem can be converted into a system of linear equations that can be solved using robust statistical methods, i.e. the presence of outliers do not significantly affect the solution. Once

*d*

_{ jj }and hence $\tilde{W}$ are computed, the affinity of the probes are the maximum values of each row of this matrix.

*G*can be computed by,

In this equation, all the entries of the $\tilde{G}$ matrix are between zero and one, since they are obtained by dividing each entry of $\tilde{W}$ by the maximum value for each of the rows.

### Using the information of the location of the probes. Structure coherence correction

Affymetrix probes are grouped in sets of probes. A set of probes should hybridize against the same feature of a gene (an exon or a part of an exon) and can be considered as a whole. The previous steps of the algorithm do not take this fact into account and treat each probe independently. The predicted structure can contain errors due to bad quality probes, large noise or limitations of the algorithm. We can take advantage of Affymetrix redundancy by forcing the coherence of the set of probes; all of them have the same pattern against the different transcripts. In the suggested matrix form, as the hybridization pattern of a probe corresponds to a row of the *G* matrix, all the rows that correspond to probes within the same set must be identical.

Our algorithm selects for each probeset (a subset of rows of matrix *G*) the closest binary matrix of rank equal to one (all the rows have the same values). This matrix is obtained simply by rounding the mean value of each of the columns of the submatrix that corresponds to the probeset. Finally, a threshold is set to all the entries of the *G* matrix.

## Declarations

### Acknowledgements

Miguel A. Anton's contract is financed by the Ministry of Education of Spain within the framework of Torres Quevedo Programme and co- financed by the European Social Fund. We would like to thank Luis Montuenga, Ruben Pio and David Blanco for their support and advice within the study of AS in lung cancer.

## Authors’ Affiliations

## References

- Pio R, Montuenga L: Alternative splicing in lung cancer.
*J Thorac Oncol*2009, 4(6):674–8. 10.1097/JTO.0b013e3181a520dcView ArticlePubMedGoogle Scholar - Castle J, Zhang C, Shah J, Kulkarni A, Kalsotra A, Cooper T, Johnson J: Expression of 24,426 human alternative splicing events and predicted cis regulation in 48 tissues and cell lines.
*Nat Genet*2008, 40(12):1416–25. 10.1038/ng.264View ArticlePubMedPubMed CentralGoogle Scholar - Xing Y, Kapur K, Wong W: Probe selection and expression index computation of Affymetrix Exon Arrays.
*PLoS ONE*2006, 1: e88. 10.1371/journal.pone.0000088View ArticlePubMedPubMed CentralGoogle Scholar - Clark T, Schweitzer A, Chen T, Staples M, Lu G, Wang H, Williams A, Blume J: Discovery of tissue-specific exons using comprehensive human exon microarrays.
*Genome Biol*2007, 8(4):R64. 10.1186/gb-2007-8-4-r64View ArticlePubMedPubMed CentralGoogle Scholar - Purdom E, Simpson K, Robinson M, Conboy J, Lapuk A, Speed T: FIRMA: a method for detection of alternative splicing from exon array data.
*Bioinformatics*2008, 24(15):1707–14. 10.1093/bioinformatics/btn284View ArticlePubMedPubMed CentralGoogle Scholar - Cline M, Blume J, Cawley S, Clark T, Hu J, Lu G, Salomonis N, Wang H, Williams A: ANOSVA: a statistical method for detecting splice variation from expression data.
*Bioinformatics*2005, 21(Suppl 1):i107–15. 10.1093/bioinformatics/bti1010View ArticlePubMedGoogle Scholar - Rasche A, Herwig R: ARH: predicting splice variants from genome-wide data with modified entropy.
*Bioinformatics*2010, 26: 84–90. 10.1093/bioinformatics/btp626View ArticlePubMedGoogle Scholar - de la Grange P, Gratadou L, Delord M, Dutertre M, Auboeuf D: Splicing factor and exon profiling across human tissues.
*Nucleic Acids Res*2010, 38(9):2825–38. 10.1093/nar/gkq008View ArticlePubMedPubMed CentralGoogle Scholar - Clark T, Sugnet C, Ares MJ: Genomewide analysis of mRNA processing in yeast using splicing-specific microarrays.
*Science*2002, 296(5569):907–10. 10.1126/science.1069415View ArticlePubMedGoogle Scholar - Srinivasan K, Shiue L, Hayes JD, Centers R, Fitzwater S, Loewen R, Edmondson LR, Bryant J, Smith M, Rommelfanger C, Welch V, Clark TA, Sugnet CW, Howe KJ, Mandel-Gutfreund Y, Ares MJ: Detection and measurement of alternative splicing using splicing-sensitive microarrays.
*Methods*2005, 37(4):345–359. 10.1016/j.ymeth.2005.09.007View ArticlePubMedGoogle Scholar - Affymetrix[http://www.affymetrix.com]
- Brainarray[http://brainarray.mbni.med.umich.edu]
- Wang H, Hubbell E, Hu JS, Mei G, Cline M, Lu G, Clark T, Siani-Rose MA, Ares M, Kulp DC, Haussler D: Gene structure-based splice variant deconvolution using a microarray platform.
*Bioinformatics*2003, 19(Suppl 1):i315-i322. 10.1093/bioinformatics/btg1044View ArticlePubMedGoogle Scholar - Turro E, Lewin A, Rose A, Dallman MJ, Richardson S: MMBGX: a method for estimating expression at the isoform level and detecting differential splicing using whole-transcript Affymetrix arrays.
*Nucl Acids Res*2010, 38: e4. 10.1093/nar/gkp853View ArticlePubMedPubMed CentralGoogle Scholar - She Y, Hubbell E, Wang H: Resolving deconvolution ambiguity in gene alternative splicing.
*BMC Bioinformatics*2009, 10: 237. 10.1186/1471-2105-10-237View ArticlePubMedPubMed CentralGoogle Scholar - Hiller D, Jiang H, Xu W, Wong W: Identifiability of isoform deconvolution from junction arrays and RNA-Seq.
*Bioinformatics*2009, 25(23):3056–9. 10.1093/bioinformatics/btp544View ArticlePubMedPubMed CentralGoogle Scholar - Anton M, Gorostiaga D, Guruceaga E, Segura V, Carmona-Saez P, Pascual-Montano A, Pio R, Montuenga L, Rubio A: SPACE: an algorithm to predict and quantify alternatively spliced isoforms using microarrays.
*Genome Biol*2008, 9(2):R46. 10.1186/gb-2008-9-2-r46View ArticlePubMedPubMed CentralGoogle Scholar - Owen A, Perry P: Bi-cross-validation of the SVD and the non-negative matrix factorization.
*Annals of Applied Statistics*2009, 3(2):564–594. 10.1214/08-AOAS227View ArticleGoogle Scholar - GEO (Gene Expression Omnibus)[http://www.ncbi.nlm.nih.gov/geo/]
- French P, Peeters J, Horsman S, Duijm E, Siccama I, van den Bent M, Luider T, Kros J, van der Spek P, Sillevis Smitt P: Identification of differentially regulated splice variants and novel exons in glial brain tumors using exon expression arrays.
*Cancer Res*2007, 67(12):5635–42. 10.1158/0008-5472.CAN-06-2869View ArticlePubMedGoogle Scholar - Kwan T, Benovoy D, Dias C, Gurd S, Provencher C, Beaulieu P, Hudson T, Sladek R, Majewski J: Genome-wide analysis of transcript isoform variation in humans.
*Nat Genet*2008, 40(2):225–31. 10.1038/ng.2007.57View ArticlePubMedGoogle Scholar - Xing Y, Stoilov P, Kapur K, Han A, Jiang H, Shen S, Black D, Wong W: MADS: a new and improved method for analysis of differential alternative splicing by exon-tiling microarrays.
*RNA*2008, 14(8):1470–9. 10.1261/rna.1070208View ArticlePubMedPubMed CentralGoogle Scholar - Hung L, Heiner M, Hui J, Schreiner S, Benes V, Bindereif A: Diverse roles of hnRNP L in mammalian mRNA processing: a combined microarray and RNAi analysis.
*RNA*2008, 14(2):284–96. 10.1261/rna.725208View ArticlePubMedPubMed CentralGoogle Scholar - Kapur K, Jiang H, Xing Y, Wong W: Cross-hybridization modeling on Affymetrix exon arrays.
*Bioinformatics*2008, 24(24):2887–93. 10.1093/bioinformatics/btn571View ArticlePubMedPubMed CentralGoogle Scholar - Silver J, Ritchie M, Smyth G: Microarray background correction: maximum likelihood estimation for the normal-exponential convolution.
*Biostatistics*2009, 10(2):352–63. 10.1093/biostatistics/kxn042View ArticlePubMedPubMed CentralGoogle Scholar - Irizarry R, Hobbs B, Collin F, Beazer-Barclay Y, Antonellis K, Scherf U, Speed T: Exploration, normalization, and summaries of high density oligonucleotide array probe level data.
*Biostatistics*2003, 4(2):249–64. 10.1093/biostatistics/4.2.249View ArticlePubMedGoogle Scholar - Aroma.affymetrix[http://www.aroma-project.org/]
- Bengtsson H, Simpson K, Bullard J, Hansen K: Aroma.affymetrix: A generic framework in R for analyzing small to very large Affymetrix data sets in bounded memory.
*Department of Statistics, University Of California, Berkeley*2008. Tech Report #745 Tech Report #745Google Scholar - Barnett V, Lewis T:
*Outliers in Statistical Data (Probability & Mathematical Statistics)*. 3rd edition. Wiley; 1994.Google Scholar - Durinck S, Bullard J, Spellman P, Dudoit S: GenomeGraphs: integrated genomic data visualization with R.
*BMC Bioinformatics*2009, 10: 2. 10.1186/1471-2105-10-2View ArticlePubMedPubMed CentralGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<url>http://creativecommons.org/licenses/by/2.0</url>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.