- Proceedings
- Open access
- Published:

# Data-driven encoding for quantitative genetic trait prediction

*BMC Bioinformatics*
**volume 16**, Article number: S10 (2015)

## Abstract

### Motivation

Given a set of biallelic molecular markers, such as SNPs, with genotype values on a collection of plant, animal or human samples, the goal of quantitative genetic trait prediction is to predict the quantitative trait values by simultaneously modeling all marker effects. Quantitative genetic trait prediction is usually represented as linear regression models which require quantitative encodings for the genotypes: the three distinct genotype values, corresponding to one heterozygous and two homozygous alleles, are usually coded as integers, and manipulated algebraically in the model. Further, epistasis between multiple markers is modeled as multiplication between the markers: it is unclear that the regression model continues to be effective under this. In this work we investigate the effects of encodings to the quantitative genetic trait prediction problem.

### Results

We first showed that different encodings lead to different prediction accuracies, in many test cases. We then proposed a data-driven encoding strategy, where we encode the genotypes according to their distribution in the phenotypes and we allow each marker to have different encodings. We show in our experiments that this encoding strategy is able to improve the performance of the genetic trait prediction method and it is more helpful for the oligogenic traits, whose values rely on a relatively small set of markers. To the best of our knowledge, this is the first paper that discusses the effects of encodings to the genetic trait prediction problem.

## Background

Whole genome prediction of complex phenotypic traits using high-density genotyping arrays has attracted a lot of attention, as it is relevant to the fields of plant and animal breeding and genetic epidemiology [1–8]. Given a set of biallelic molecular markers, such as SNPs, with genotype values encoded as {0, 1, 2} on a collection of plant, animal or human samples, the goal is to predict the quantitative trait values by simultaneously modeling all marker effects.

One of the earliest, though still very relevant, treatments of genomic selection was given in [1]. In the article, the authors present four approaches: *least-squares estimation*, *BayesA*, *BayesB*, and *rrBLUP* (Ridge-Regression BLUP), based on a linear model of the marker effects on the trait being studied. The latter three methods are still competitive with the state-of-art techniques, and have also spawned a number of interesting variants. Specifically, rrBLUP [1, 9] has been used widely for trait prediction where it builds a linear model by fitting all the genotypes, and the coefficient computed for each marker can be considered as a measure of the importance of the marker. The name rrBLUP stands for "ridge-regression" BLUP, where BLUP stands for the standard "best linear unbiased prediction" approach used in the field. rrBLUP can be viewed as either ridge-regression with a specific shrinkage parameter, or a particular mixed model equation with certain variance components [10, 11]. The rrBLUP method has the benefits of the underlying hypothesis of normal distribution of the trait value and the marker effects, which is well suited for highly polygenic traits; rrBLUP is computationally efficient and robust, which makes it one of the most commonly used models in whole genome prediction. Other popular predictive models are Elastic-Net, Lasso, Ridge Regression [12, 13], Bayes A, Bayes B [1], Bayes *C*_{
π
} [14], and Bayesian Lasso [15, 16], as well as other machine learning methods.

The genetic trait prediction problem is defined as follows. Given *n* training samples, each with *m* ≫ *n* genotype values (we use "feature", "marker", "genotype", "SNP" interchangeably) and a trait value, and a set of *n′* test samples each with the same set of genotype values but without trait value, the task is to train a predictive model from the training samples to predict the trait value, or phenotype of each test sample based on their genotype values. Let *Y* be the trait value of the training samples. The problem is usually represented as the following linear regression model:

where *X*_{
i
} is the *i*-th genotype value, *m* is the total number of genotypes and *β*_{
i
} is the regression coefficient for the *i*-th genotype, *e*_{
l
} is the error term. We call this model *single marker model*.

The above model assumes that only the single markers, or main effects, play a role for the prediction. However, it is known that the interactions of the genotypes may also contribute to the genetic traits under certain conditions, which is known as *Epistasis* [17]. The pairwise epistasis between two genotypes *X*_{
i
} and *X*_{
j
} is often modeled as the product of the two genotype values. Therefore, with the traditional representation, the linear regression model with pairwise epistasis effects is modified as the following:

where *X*_{
i
}*X*_{
j
} is the product of the genotype values of the *i*-th and *j*-th genotype and it denotes the interaction of the two genotypes, *α*_{
i,j
} represents the coefficient for the interaction. Thus in this epistasis model, the epistasis effects are considered as augmented genotypes besides the original genotype matrix *X*. We call this model *epistasis model*.

Genotypes for a marker can be either homozygous or heterozygous. For Genome Wide Association Study (GWAS), we only need to identify the association between a marker and the case/control trait. Therefore, we care more about whether genotypes are homozygous or heterozygous and the frequency of the alleles. They don't necessarily need to be quantitative. They are usually represented as a pair of alleles, for example "AA" and "TT" for homozygous genotypes, "AT" for heterozygous genotype.

On the other hand, for genetic trait prediction problem, in Equation 1 and 2, the genetic trait values *Y* are quantitative. Thus the genotypes *X*_{
i
} need to be quantitative as well. Researchers generally assign three distinct encodings to the three possible genotype values. A few common sets of encodings for genotypes are {0, 1, 2}, where 0 and 2 are for homozygous genotypes and 1 is for heterozygous genotype, and {−1, 0, 1}, where -1 and 1 are for homozygous genotypes and 0 is for heterozygous genotype.

As genotypes need to be encoded, different encodings may lead to different prediction accuracies, especially for the epistasis model. This is because the multiplications of different encodings are different. For example, the multiplication of two heterozygous genotypes for encoding {0, 1, 2} is 1 × 1 = 1, but for encoding {−1, 0, 1} is 0 × 0 = 0. It's not clear which encoding should we use nor which encoding will produce better results. Another unreasonable setting is different interactions of the genotypes may have the same value. For example, the multiplication of two genotypes 0, 1 and 0, 2 are both 0. But there is no biological interpretation why the two genotype interactions contribute "identically" to the trait.

Based on the above observations, we developed a novel data-driven encoding method where the encoding of the genotypes depends on the data itself. The basic idea is straitforward: For each genotype *g* of each marker *i*, we identify the set of trait values for the samples whose genotype is *g* at marker *i*. Then we take the average of this set of traits and replace the genotype with this average value. Thus all the genotypes can be determined by the data itself and the encoding allows each marker to be encoded differently. We call this encoding method *pure data-driven encoding*.

In the traditional encoding, heterozygous genotype is the average value of the two homozygous genotypes, thus from the encoding we could tell which one is heterozygous genotype, which ones are homozygous genotypes. One problem of the pure data-driven encoding is that we can not distinguish between the homozygous genotype and heterozygous genotype any more, as their encodings completely depend on the data. So we propose a second version of the encoding, where we compute the new encoding for the two homozygous genotypes the same as in the pure data-driven encoding method, but we compute the new encoding for the heterozygous genotype as the mean of the whole data set. We call this encoding method *hybrid data-driven encoding*. More details will be given in the methods section.

## Related work

Lots of techniques have been applied to the genetic trait prediction problem defined in Equation 1. Consider the typical situation for linear regression, where we have the training set y\in {\mathbb{R}}^{l}, x\in {\mathbb{R}}^{l\times n}, in a standard linear regression, we wish to find parameters *β*_{0}, *β* such that the sum of square residuals, {\sum}_{i=1}^{l}{\left({y}_{i}-{\beta}_{0}-{x}_{i}^{\top}\beta \right)}^{2}, is minimized.

The *lasso* approach [12, 13] uses an additional *l*_{1} penalty which aims to achieve a sparse solution. This idea has even been extended to *group lasso* where variable are included or excluded in groups [18, 19]. Alternatively *Ridge regression* (or *Tikhonov regularization*)[20] uses an *l*_{2} penalty which is ideal for the case when many predictors have non-zero coefficients. *Elastic-net* uses both an *l*_{1} and *l*_{2} penalty with a trade off parameter between the two [21]. Consequently lasso and ridge regression can be seen as special cases of Elastic-net. See [22] and references therein. The Elastic-net problem can be stated as

Thus when *α* = 1 corresponds to lasso and *α* = 0 corresponds to ridge.

Elastic-Net (with non-zero *α*) can be easily extended for genome wide associate studies by use of the non-zero *β* parameters selected when training the data. That is, the *l*_{1} penalty achieves a sparse solution, and in turn signals which variables contribute most when training on the data.

*rrBLUP (Ridge regression BLUP)* [1, 9] is one of the most popular methods for genetic trait prediction. rrBLUP simply is ridge regression with a specific choice of *λ* in (3). Specifically, Meuwissen et al. [23] assumes that the *β* coefficients are iid from a normal distribution such that *β*_{
i
} ~ *N* (0, *σ*_{
β
}). Then the choice of \lambda ={\sigma}_{e}^{2}/{\sigma}_{\beta}^{2} where {\sigma}_{e}^{2} is the residual error. In this case, the ridge regression penalized estimator is equivalent to best linear unbiased predictor (BLUP) [24].

Support vector machines (SVMs) are a tool in statistics and machine learning for the task of supervised learning [25–29] used for either classification or regression. Here we are interested in the latter case. Following [30], given a training set (**x** _{i}, y_{i}), *i* = 1,...*l*, where {x}_{i}\in {\mathbb{R}}^{n}, the goal of *ε*-SV regression is to find a function *f*(**x**) that is at most *ε* deviation from the training data *y*_{
i
} over the training data **x**_{
i
}, while remaining as flat as possible in the feature space. Training an SVM requires solving

The data vectors **x**_{
i
} are mapped to another space via the function *ϕ*, and SVM attempts to fit the data in this higher dimensional space. Thus, the choice of *ϕ*, referred to as the *kernel*, has a large impact. Four kernels are usually used:

Support vector regression involves solving Equation 4 given training data. The vector **w**, the choice of the kernel, and the choice of kernel parameters, used previously to solve Equation 4 gives a model capable of predicting future data.

The above work all aim to solve single marker genetic trait prediction. There are also lots of existing work on epistasis models for GWAS. As exhaustive search of all possible epistasis interactions is infeasible even for a small number of markers, greedy strategies [31–36] have been applied to detect epistasis effects where a subset of high-marginal effect markers, which are markers that contribute to the trait themselves, are first selected. Then the test is conducted either between all the markers in this subset or between the markers in this subset and the remaining markers. These strategies, however, miss all the possible epistasis between the low-marginal effect markers, which are shown to exist [17]. Xiang et al. [37] proposed an optimal algorithm to efficiently detect epistasis without conducting an extensive search. A data structure is created to effectively prune interactions that are potentially insignificant. These work focus on GWAS and they do not require a quantitative encoding. As a result, none of the existing work investigated the effects of encoding for genetic trait prediction, where quantitative encoding is a must. As multiplication is one of the most popular epistasis models, in this work, we consider only the multiplication model for epistasis.

## Methods

Genotype usually has three values, one for the homozygous major allele, one for the homozygous miner allele and one for the heterozygous allele. In the traditional encoding {0, 1, 2}, 1 is the value for the heterozygous genotype, 0 and 2 are for the homozygous genotype, one on major allele, one on miner allele. All the markers are encoded the same way. In this work, we propose two data-driven encoding strategies. The first encoding strategy is called *pure data-driven encoding*. The new encoding for genotype of value 0 at marker *i* is computed as *E*(*i*, 0) = *Ave*(*trait*(*i*, 0)), where *E*(*i*, 0) is the new encoding for genotype of value 0 at maker *i*, *trait*(*i*, 0) is the set of traits for the samples whose genotypes are 0 at marker *i*, *Ave*() is the function to compute the average value. Thus we also have *E*(*i*, 1) = *Ave*(*trait*(*i*, 1)), *E*(*i*, 2) = *Ave*(*trait*(*i*, 2)).

The first encoding strategy is pure data-driven. It doesn't distinguish homozygous genotypes with heterozygous genotypes. Thus we developed the second encoding strategy *hybrid data-driven encoding*, where we still have *E*(*i*, 0) = *Ave*(*trait*(*i*, 0)) and *E*(*i*, 2) = *Ave*(*trait*(*i*, 2)) for the two homozygous genotypes 0, 2. However, for the heterozygous genotype 1, we have *E*(*i*, 1) = *Ave*(*trait*(*i*, {0, 1, 2})), where *trait*(*i*, {0, 1, 2}) indicates the trait values for all the samples. The intuition of this encoding strategy is from the traditional encoding that the encoded value of the heterozygous genotype should be the average of the values for homozygous genotypes. However, we would also like to take the trait values into consideration so that the encoding of the heterozygous genotype not only depends on the encoding of the homozygous genotypes, but also the corresponding trait values. As we will show later in the experiments, the pure data-driven encoding is in general worse than the traditional encoding, and the hybrid data-driven encoding is in general better than the traditional encoding.

The data-driven encoding strategies can be naturally extended to pairwise epistasis effects or even higher dimensional epistasis effects. As the hybrid data-driven encoding has better performance, the extension is based on the hybrid data-driven encoding method. As shown in Figure 1, for pairwise epistasis effects, given the traditional encoding {0, 1, 2}, we have 9 possible combinations for markers *i* and *j*, organized in the 3 × 3 grid matrix. Assuming 0 is the traditional encoding for homozygous genotype with major allele, 2 is the traditional encoding for homozygous genotype with miner allele, 1 is traditional encoding for heterozygous genotype, then the cell (0, 0) (from now on, for simplicity, we ignore the marker indices *i, j* for the cell) is the traditional encoding for a pair of homozygous genotypes, both with major allele, the cell (2, 2) is the traditional encoding for a pair of homozygous genotypes, both with miner allele, the cell (1, 2) is the traditional encoding for a pair of heterozygous genotype and homozygous genotype with miner allele. The meaning of the other cells can be inferred similarly.

Our goal is to encode each cell using the data-driven approach. We first compute the data-driven encoding for the four corner cells (0, 0), (0, 2), (2, 0), (2, 2) as the average of their corresponding trait values, as shown in Figure 1. For example, *E*(*i, j*, 0, 0) = *Ave*(*trait*(*i, j*, 0, 0)), where *trait*(*i, j*, 0, 0) is the set of traits for the samples whose traditional genotypes at marker *i, j* are 0 and 0, respectively. Then for the cells (1, 0), (0, 1), (2, 1), (1, 2), we compute their data-driven encoding by extending the encoding strategy for single markers. For example, *E*(*i, j*, 1, 0) = *Ave*(*trait*(*i, j*, {0, 1, 2}, 0)), where *trait*(*i, j*, {0, 1, 2}, 0) is the set of traits for the samples whose traditional genotype at marker *i* is 0 or 1 or 2, and at marker *j* is 0, respectively. The intuition is that we consider the encoding for the three cells (0, 0), (1, 0), (2, 0) for the marker pair *i, j* as fixing the genotypes for marker *j* as 0. Then the problem is converted to computing the encoding for a single marker *i*, whose genotype can be either 0, or 1, or 2. Similar encoding strategies are also applied on the cells [(0, 2), (1, 2), (2, 2)], [(0, 0), (0, 1), (0, 2)], [(2, 0), (2, 1), (2, 2)] to compute the encodings for cells (1, 2), (0, 1), (2, 1), respectively.

Finally for the cell in the center (1, 1), we compute its data-driven encoding as the average of all the traits, namely *E*(*i, j*, 1, 1) = *Ave*(*trait*(*i, j*, {0, 1, 2}, {0, 1, 2})). This is again a strait-forward extension of the encoding strategy for single markers.

The same data-driven encoding algorithm can be further extended to higher dimensional epistasis effects. In this work, we only focused on the application of the data-driven encoding algorithm on single marker and pairwise epistasis effects.

As we will show later in the experiments in Section, the data-driven encoding not only is able to improve the performance for the epistasis model, but also for the single marker model. Next we investigate the reason that the data-driven encoding is able to improve the performance of the prediction in general. For the traditional encoding, the same genotype of different markers are encoded with the same value. However, from GWAS, we know that different SNPs have different associations to the trait. Thus the markers contribute differently to the trait. Therefore, constraining the same genotype of different markers with the same value may not be appropriate to obtain the best contrast factors, or the coefficients of the markers for the regression. Our encoding method, on the contrary, allows the same genotype of different markers to have different values. And the higher the association between the marker and the trait is, the more close the new encoding values to the trait value. The regression based on the new encodings thus can more effectively identify the contributions of the markers, leading to better accuracy. This also explains why the data-driven encoding works better for olygogenic traits, which depend on relatively few number of markers. For these olygogenic traits, a few markers are significantly associated with them. The data-driven encodings of these markers are close to the value of the traits and they can be more easily identified in the regression. Thus the prediction can be improved. On the contrary, for polygenic traits, which depend on a large number of markers, all these markers have similar associations. Thus the new encoding values are similar to each other. So the data-driven encoding is not able to improve the prediction performance much. In our future work, we would like to propose a theoretical analysis for the performance of the data-driven encoding.

## Results

As rrBLUP is one of the most commonly used methods for genetic trait prediction, in our experiments, we evaluate the prediction accuracy of rrBLUP for different encodings.

### Effects of different encodings

We first illustrate that different encodings lead to different prediction performances for epistasis model defined in Formula 2, thus a data-driven encoding has the benefit that we do not need to worry about the selection of the encodings. We use the Maize data set [7], which consists of two maize diversity panels with 300 Flint and 300 Dent lines developed for the European CornFed program. The two panels, Flint and Dent, were genotyped using a 50 k SNP array, which after removing SNPs with high rate of missing markers and high average heterozygosity, yielded 29,094 and 30,027 SNPs respectively. Both of them contain 261 samples. In this experiment, we use only Dent data set. For a pair of SNPs, we consider the following four combinations of encodings (*SNP*_{1}, *SNP*_{2}) as (*E*1 = {0, 1, 2}, {0, 1, 2}), (*E*2 = {0, 1, 2}, {2, 1, 0}), (*E*3 = {2, 1, 0}, {0, 1, 2}), (*E*4 = {2, 1, 0}, {2, 1, 0}).

We test all pairwise epistasis effects under the four combinations of encodings and rank the epistasis effects according to their mutual information to the trait. Then we measure the correlation of the ranks among these four combinations. Spearman's rank correlation is a popular method to compare two ranks. However, it requires that the two ranks have the same set of elements. While in our case, the ranks reported by different encodings overlap but may contain different SNP pairs. So we adopted an average accuracy correlation method [38]. The results for Dent trait Tass are shown in Table 1. We can see that the ranks from different encoding strategies have very low correlations, indicating that different encodings lead to completely different epistasis effects.

Next we compare the performance of rrBLUP for the two encodings {0, 1, 2} and {−1, 0, 1} and we apply rrBLUP on all the three traits of Dent under each encoding, respectively. We applied the epistasis model in Formula 2 and show the average results of 10-fold cross validation in Table 2. The performance is measured as the square of the person's correlation, or *r*^{2}. The larger the *r*^{2}, the better the regression is and the better the prediction is. As we can see, the two encodings lead to very different accuracies and {0, 1, 2} is a better encoding on the Dent data set.

### Simulated Data

We next compare the predictive performance of rrBLUP based on the traditional encoding {0, 1, 2} and the two versions of data-driven encodings we proposed. We simulate both polygenic traits and oligogenic traits. We randomly generate the genotype matrix *X* of size 100 × 500, namely 100 samples each with 500 genotypes. The trait is generated according to the formula Y={\sum}_{i=1}^{m}{\beta}_{i}{X}_{i}+{e}_{l}. The coefficient of the markers *β*_{
i
} and the residual error *e*_{
l
} are also randomly generated. We set the coefficients of the first *s* genotypes, namely *β*_{1}, *β*_{2},...,*β*_{
s
}, as non-zero and of the remaining genotypes as 0. We vary the value of *s* as 5, 10, 20, 50, 100, with small *s* for oligogenic traits and large *s* for polygenic traits. Out of 100 samples, 90 are training samples and 10 are test sample. We randomly simulate 10 data sets and for each data set we conduct 10-fold cross validation. We compute the average prediction performance and show the results in Table 4.

We can see that when *s* is small, for example, *s* = 5, 10, 20, the traits are oligogenic and the performance of the hybrid encoding is better than that of the traditional encoding. However, when *s* is big, for example, *s* = 50, 100, 200, the traits are polygenic, the performance of the hybrid encoding is worse than that of the traditional encoding. We also observe that the pure data-driven encoding works poorly for all cases, indicating that it is important to also take into consideration the relationship of homozygous and heterozygous genotypes.

### Real data

Next we apply the new encoding strategy to four different data sets. As the pure data-driven encoding shows poor performance, we evaluate only the hybrid data-driven encoding. We compare the performance of rrBLUP on both the traditional encoding and the hybrid data-driven encoding and show the average *r*^{2} of 10-fold cross validation.

The first data set is the Maize data set [7] which was used to evaluate the effects of different encodings in Section. As we can see in Table 3, for all six traits, the data-driven encoding achieves better performance than the traditional encoding does.

The second data set is the Asian rice, Oryza sativa, data set [39]. This data set was based on 44,100 SNP variants from 413 accessions of O. sativa, taken from 82 countries containing 34 phenotypes. We selected two phenotypes, one is polygenic (Protein.content), one is oligogenic (Pericarp.color). The data sets have 36,901 markers and 413 samples. We again vary the number of selected features as 500, 1000. As shown in Table 3, for the oligogenic trait (Pericarp.color), the performance of the data-driven encoding is significantly better than that of the traditional encoding. On the contrary, for the polygenic trait (Protein.content), the two encodings achieve similar performance. This is consistent with our simulation, namely the data-driven encoding works better for oligogenic traits.

The third data set is Pig data set, which is a collection data on male and female pigs born since 2000 and was taken from [5] and consists of 3,534 animals from a single PIC nucleus pig line yielding 52,842 SNPs with five measured traits (phenotypes). Only traits 2 and 4 were selected for study here. As described in [5], genotypes were sequenced from the Illumina PorcineSNP60 chip and full pedigree information is available, which we did not use in this study. In the original study, trait 2 was rescaled by a weighted mean of corrected progeny phenotypes. Whereas trait 4 was corrected for environmental factors such as year of birth and location. Genotypes were filtered for minor allele frequency less than 0.001 and with missing genotypes less than 10%. The original study used AlphaImpute to impute any missing data [14]. As we can see in Table 3, for both traits, the data-driven encoding achieves better performance.

The fourth data set is QTLMAS data set, which was taken from the QTL-MAS Workshop, which was held on May 17-18, 2010 in Poznan Poland [1]. The data set consists of 3,226 individuals over five generations (F0-F4) with 20 founders, five male and 15 females. There were two phenotype traits, the first a quantitative trait and the second a binary trait. Only the first four generations (2,326 individuals) have phenotype records. The genome is approximately 500 million bp with five chromosomes, each 100 million bp. In total, each individual was genotypes for 10,031 biallelic SNPs. We can see in Table 3, data-driven encoding achieves better performance for Trait 1 and worse performance for Trait 2.

For genetic prediction, an improvement of 5% is considered as significant. As shown in Table 3, in general the data-driven encoding is able to improve the prediction performance and in many cases the improvement is significant. Thus even for single marker model, the data-driven encoding is superior to the traditional encoding.

We also applied the data-driven encoding strategy on the epistasis model shown in Formula 2. We computed all pairs of epistasis effects and selected the top 2,000 pairs, using their relevance, measured by mutual information, to the trait. We then include these top 2,000 pairs of epistasis effects in Formula 2. We conducted the experiments only on the Maize data set as it is the only data set that is small enough for an extensive search.

As we can see in Table 5, the performance of epistasis is better for most of the traits when using the data-driven encoding. For the two traits where the traditional encoding is better, the performance of the data-driven encoding is only slightly worse than that of the original encoding.

## Conclusions

In this work, we showed that the genetic trait prediction problem heavily depends on the encoding of genotypes, especially when epistasis effects are considered. We developed a data-driven encoding method which is simple but effective with the benefits that we don't need to choose between different encodings. Out experiments show that the data-driven encoding is able to improve the prediction accuracy for both single marker model and epistasis model, especially for olygogenic traits. To our knowledge, this is the first work that discusses the effects of encodings for genetic trait prediction problem. In our future work, we would like to theoretically analyze the effects of the data-driven encoding for the genetic trait prediction problem.

## References

Meuwissen THE, Hayes BJ, Goddard ME: Prediction of total genetic value using genome-wide dense marker maps. Genetics. 2001, 157: 1819-1829.

Jannink J-L, Lorenz AJ, Iwata H: Genomic selection in plant breeding: from theory to practice. Briefings in Functional Genomics. 2010, 9 (2): 166-177. 10.1093/bfgp/elq001.

Heffner EL, Sorrells ME, Jannink J-L: Genomic selection for crop improvement. Crop Science. 2009, 49 (1): 1-12. 10.2135/cropsci2008.08.0512.

Xu Y, Crouch JH: Marker-assisted selection in plant breeding: from publications to practice. Crop Science. 2008, 48 (2): 391-407. 10.2135/cropsci2007.04.0191.

Lande R, Thompson R: Efficiency of marker-assisted selection in the improvement of quantitative traits. Genetics. 1990, 124 (3): 743-756.

Hayes B, Bowman P, Chamberlain A, Goddard M: Genomic selection in dairy cattle: Progress and challenges. Journal of Dairy Science. 2009, 92 (2): 433-443. 10.3168/jds.2008-1646.

Rincent R, Nicolas S, Altmann T, Brunel D, Revilla P, Rodriguez VM, Moreno-Gonzalez J, Melchinger A, Bauer E, et al: Maximizing the reliability of genomic selection by optimizing the calibration set of reference individuals: Comparison of methods in two diverse groups of maize inbreds (zea mays l.). Genetics. 2012, 192 (2): 715-728. 10.1534/genetics.112.141473.

Cleveland MA, Hickey JM, Forni S: A common dataset for genomic analysis of livestock populations. G3: Genes--Genomes--Genetics. 2012, 2 (4): 429-435.

Whittaker JC, Thompson R, Denham MC: Marker-assisted selection using ridge regression. Genet Res. 2000, 75: 249-252. 10.1017/S0016672399004462.

VanRaden P: Efficient methods to compute genomic predictions. Journal of dairy science. 2008, 91 (11): 4414-4423. 10.3168/jds.2007-0980.

Habier D, Fernando R, Dekkers J: The impact of genetic relationship information on genome-assisted breeding values. Genetics. 2007, 177 (4): 2389-2397.

Tibshirani R: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B. 1994, 58: 267-288.

Chen SS, Donoho DL, Saunders A: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing. 1998, 20: 33-61. 10.1137/S1064827596304010.

Kizilkaya K, Fernando R, Garrick D: Genomic prediction of simulated multibreed and purebred performance using observed fifty thousand single nucleotide polymorphism genotypes. Journal of animal science. 2010, 88 (2): 544-551. 10.2527/jas.2009-2064.

Legarra A, Robert-Granié C, Croiseau P, Guillaume F, Fritz S, et al: Improved lasso for genomic selection. Genetics research. 2011, 93 (1): 77-10.1017/S0016672310000534.

Park T, Casella G: The bayesian lasso. Journal of the American Statistical Association. 2008, 103: 681-686. 10.1198/016214508000000337.

Kilpatrick JR: Methods for detecting multi-locus genotype-phenotype association. PhD thesis. 2009, RICE UNIVERSITY

Yuan M, Yuan M, Lin Y, Lin Y: Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B. 2006, 68: 49-67. 10.1111/j.1467-9868.2005.00532.x.

Meier L, Geer SVD, Bühlmann P, Zürich ETH: The group lasso for logistic regression. Journal of the Royal Statistical Society, Series B. 2008

Hoerl AE, Kennard RW: Ridge regression: Biased estimation for nonorthogonal problems. Technometrics. 1970, 12: 55-67. 10.1080/00401706.1970.10488634.

Zou H, Hastie T: Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society, Series B. 2005, 67: 301-320. 10.1111/j.1467-9868.2005.00503.x.

Friedman J, Hastie T, Tibshirani R: Regularization paths for generalized linear models via coordinate descent. Journal of Statistical Software. 2010, 33 (1): 1-22.

Meuwissen THE, Hayes BJ, Goddard ME: Prediction of total genetic value using genome-wide dense marker maps. Genetics. 2001, 157: 1819-1829.

Ruppert D, Wand MP, Carroll RJ: Semiparametric Regression. Cambridge Series in Statistical and Probabilistic Mathematics. 2003, Cambridge University Press, New York, NY

Boser BE, et al: A training algorithm for optimal margin classifiers. Proceedings of the 5th Annual ACM workshop on computational learning theory. 1992, ACM Press, 144-152.

Guyon I, Boser B, Vapnik V: Automatic capacity tuning of very large vc-dimension classifiers. Advances in Neural Information Processing Systems. 1993, Morgan Kaufmann, 147-155.

Cortes C, Vapnik V: Support-vector networks. Machine Learning. 1995, 273-297.

Schölkopf B: Support Vector Learning. 1997, [http://www.kernel-machines.org]

Vapnik V, Golowich SE, Smola A: Support vector method for function approximation, regression estimation, and signal processing. Advances in Neural Information Processing Systems 9. 1996, MIT Press, 281-287.

Smola AJ, Schölkopf B: A tutorial on support vector regression. Statistics and Computing. 2004, 14 (3): 199-222. doi:10.1023/B:STCO.0000035301.49549.88

Pattin KA, White BC, Barney N, Gui J, Nelson HH, Kelsey KT, Andrew AS, Karagas MR, Moore JH: A computationally efficient hypothesis testing method for epistasis analysis using multifactor dimensionality reduction. Genetic epidemiology. 2009, 33 (1): 87-94. 10.1002/gepi.20360.

Marchini J, Donnelly P, Cardon LR: Genome-wide strategies for detecting multiple loci that influence complex diseases. Nature genetics. 2005, 37 (4): 413-417. 10.1038/ng1537.

Cook NR, Zee RY, Ridker PM: Tree and spline based association analysis of gene-gene interaction models for ischemic stroke. Statistics in medicine. 2004, 23 (9): 1439-1453. 10.1002/sim.1749.

Yang C, He Z, Wan X, Yang Q, Xue H, Yu W: Snpharvester: a filtering-based approach for detecting epistatic interactions in genome-wide association studies. Bioinformatics. 2009, 25 (4): 504-511. 10.1093/bioinformatics/btn652.

Zhang Y, Liu JS: Bayesian inference of epistatic interactions in case-control studies. Nature genetics. 2007, 39 (9): 1167-1173. 10.1038/ng2110.

Fang G, Haznadar M, Wang W, Yu H, Steinbach M, Church TR, Oetting WS, Van Ness B, Kumar V: High-order snp combinations associated with complex diseases: efficient discovery, statistical power and functional interactions. PloS one. 2012, 7 (4): 33531-10.1371/journal.pone.0033531.

Zhang X, Huang S, Zou F, Wang W: Team: efficient two-locus epistasis tests in human genome-wide association study. Bioinformatics. 2010, 26 (12): 217-227. 10.1093/bioinformatics/btq186.

Webber W, Moffat A, Zobel J: A similarity measure for indefinite rankings. ACM Transactions on Information Systems (TOIS). 2010, 28 (4): 20-

Zhao K, Tung C-W, Eizenga GC, Wright MH, Ali ML, Price AH, Norton GJ, Islam MR, Reynolds A, Mezey J, et al: Genome-wide association mapping reveals a rich genetic architecture of complex traits in oryza sativa. Nature communications. 2011, 2: 467-

## Acknowledgements

The publication costs for this article were funded by IBM T.J. Watson Research.

This article has been published as part of *BMC Bioinformatics* Volume 16 Supplement 1, 2015: Selected articles from the Thirteenth Asia Pacific Bioinformatics Conference (APBC 2015): Bioinformatics. The full contents of the supplement are available online at http://www.biomedcentral.com/bmcbioinformatics/supplements/16/S1

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors' contributions

LP proposed the study. ZYW carried out the experiments to demonstrate the effect of encoding, DH designed and implemented the algorithms, and carried out the comparison experiments. All the authors read and approved the manuscript.

## Rights and permissions

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.

The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.

The Creative Commons Public Domain Dedication waiver (https://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.

## About this article

### Cite this article

He, D., Wang, Z. & Parida, L. Data-driven encoding for quantitative genetic trait prediction.
*BMC Bioinformatics* **16**
(Suppl 1), S10 (2015). https://doi.org/10.1186/1471-2105-16-S1-S10

Published:

DOI: https://doi.org/10.1186/1471-2105-16-S1-S10