Identification of expression quantitative trait loci by the interaction analysis using genetic algorithm
© Namkung et al; licensee BioMed Central Ltd. 2007
Published: 18 December 2007
Many genes with major effects on quantitative traits have been reported to interact with other genes. However, finding a group of interacting genes from thousands of SNPs is challenging. Hence, an efficient and robust algorithm is needed. The genetic algorithm (GA) is useful in searching for the optimal solution from a very large searchable space. In this study, we show that genome-wide interaction analysis using GA and a statistical interaction model can provide a practical method to detect biologically interacting loci. We focus our search on transcriptional regulators by analyzing gene × gene interactions for cancer-related genes. The expression values of three cancer-related genes were selected from the expression data of the Genetic Analysis Workshop 15 Problem 1 data set. We implemented a GA to identify the expression quantitative trait loci that are significantly associated with expression levels of the cancer-related genes. The time complexity of the GA was compared with that of an exhaustive search algorithm. As a result, our GA, which included heuristic methods, such as archive, elitism, and local search, has greatly reduced computational time in a genome-wide search for gene × gene interactions. In general, the GA took one-fifth the computation time of an exhaustive search for the most significant pair of single-nucleotide polymorphisms.
Gene expression variation usually results in phenotypic variation such as disease status. Searching for the regulators of gene expression is important to understand the mechanism of phenotypic change or individual variation. In recent studies, Morley et al.  have identified expression quantitative trait loci (eQTL), which contain transcriptional regulators nearby the tested markers. Additionally, they identified genomic regions containing master transcription regulators, which influenced multiple genes' expression. However, their method has only accounted for the marginal effect of the regulators. Note that the interactions among genes are common phenomena in complex biological systems. For example, Apolipoprotein E (ApoE), an important predictor of coronary artery disease, was discovered to interact with the unlinked low-density lipoprotein receptor (LDLR) gene in determining plasma cholesterol levels .
Because relatively inexpensive high-throughput genotyping techniques are available, genome-wide association studies using single-nucleotide polymorphisms (SNPs) are becoming popular. However, finding a candidate locus from thousands of SNPs accounting for gene × gene interaction is one of the greatest challenges. A search for all possible interactions requires evaluations, where k is the number of SNPs in an interaction model and n is the total number of SNPs.
One practical approach to dealing with enormous numbers of evaluations is a two-stage analysis in which the first stage selects the major SNPs with marginal effects and the second stage identifies significant interactions between the selected major SNPs and the remaining SNPs . However, this strategy does not cover the interactions among the SNPs without marginal effect. Thus, an efficient method is needed to search for all possible interactions with less computational burden.
In this study, we introduce a genetic algorithm (GA) to perform a genome-wide search for interactions. The GA is a learning method motivated by an analogy to biological evolution. GAs have been applied successfully to a variety of learning tasks and to other optimization problems [4, 5]. For example, Carlborg et al.  applied a GA in the analysis of quantitative trait loci (QTL) interaction. In order to improve the performance of the GA, we added several strategies such as archive, elitism, two distinct mutations, and local search in the vicinity.
Using the Genetic Analysis Workshop 15 (GAW15) Problem 1 data set, we investigated whether the identification of interactions among eQTL contributes to the construction of a biological network for the cancer-related genes. We first identified eQTL by single SNP analysis, and then identified additional eQTL by the interaction analysis using our GA. The genetic effect was assessed by the analysis of variance (ANOVA) model with no specific Mendelian inheritance model assumed. The eQTL identified by interaction analysis may be candidate components to reconstruct genetic architecture (relationship) among genes responsible for the phenotype, such as cancer in this study. Finally, we compared the time-complexity between our GA and an exhaustive search algorithm on the basis of the number of evaluations.
The GAW15 Problem 1 data set contains genome-wide scan genotypes and gene expression data from lymphoblastoid cells. They were collected from the 14 Utah CEPH (Centre d'Etude du Polymorphisme Humain) three-generation pedigrees. Genotypes of 2882 SNPs from autosomal and X-linked loci and expression values of 3554 genes for all individuals were provided. Among the 2882 SNPs, 190 SNPs were monomorphic, so they were excluded from the analysis.
We used data from the 56 founders to find eQTL that are associated with the expression levels of the three major cancer-related genes: BRCA1, TAF15, and EP300. The mutation of BRCA1 is known as a causal factor for the breast and ovarian cancer; EP300 for colorectal, breast, pancreatic cancer, and acute lymphocytic leukemia; TAF15 for acute lymphocytic leukemia.
Association test for the detection of eQTL using ANOVA models
Two types of ANOVA models were used. The response variable was the expression value of the cancer-related genes. The first type of ANOVA model contained only main effects and was applied to test for the association between a given SNP and a corresponding gene expression level. The second type of ANOVA model contained main effects for two SNPs and an interaction effect between them; it was used to test for the interaction effect between two SNPs on the gene expression values.
Implementation of genetic algorithm
A chromosome consists of one SNP pair (one major and one minor, see below) to be searched for a significant interaction. The initial population is constructed by choosing a predefined n major and minor SNP pairs, where a major SNP is randomly selected from a list of marginally significant SNPs detected by the first type of ANOVA models and a minor SNP is randomly selected from a list of marginally non-significant SNPs. The boundary between the major and minor SNPs is a cross-over point.
2. Fitness function
For the evaluation of each chromosome, we fit the second type of ANOVA model and use -(log(p-values)) as fitness measures for the interaction terms.
3. Selection method
After the evaluation of the chromosomes, all pairs of SNPs are sorted according to the fitness measure. The top 50% are selected as parents to reproduce in the next generation. To guarantee a stable convergence, we use elitism. The elites (a user-defined number) are inherited by the next generation without any variation.
4. Genetic operators
We use two different genetic operators, mutation, and cross-over. The first genetic operator, mutation, changes a SNP to a different SNP with a given mutation rate. A major SNP mutation replaces the major SNP by arbitrary one in the archive, a temporary storage containing unique SNPs in the top five ranks of fitness. Through mutation of major SNPs, a minor SNP in the archive can become major SNPs after second generation. Thus, interactions among minor SNPs are also searched. A minor SNP mutation alters the minor SNP to another minor SNP. The second genetic operator, cross-over, exchanges two minor SNPs among two randomly selected chromosomes.
5. Local search
In order to find additional significant interactions within the linkage disequilibrium (LD) block, we perform a local search by examining SNPs in the vicinity (+1 and -1) of all SNPs implicated in a significant interaction. If the fitness increases, the SNP under evaluation is replaced by the local test SNP. After the local search, the population is sorted again.
Identification of eQTL by the interaction analysis
We focused our search on eQTLs for three cancer related-genes. We tested the marginal effects of 2692 SNPs by fitting the first type of ANOVA model with individual SNPs and the expression values of the three cancer-related genes. The SNPs showing p-values of less than 0.001 were considered to have marginal effects and were classified as major SNPs in the genetic algorithm. All remaining SNPs were classified as minor SNPs in the genetic algorithm. Using this set of major and minor SNPs, we applied the GA for interaction analysis. We used a major mutation rate of 0.4, a minor mutation rate of 0.1, a cross-over rate of 0.6, and a population size of 1000.
For the individual SNP (marginal effects) analysis, four eQTLs for BRCA1, three eQTLs for EP300, and 18 eQTLs for TAF15 were identified as having marginal effects at the 0.001 significance level (α). Next, we applied the GA to identify significant pairs of SNPs. To maintain a nonimal significance level of 0.05, then the Bonferroni correction for multiple testing requires p < 1.38 × 10-8. WIth this threshold in mind, we chose to evaluate three values of α (1 × 10-6, 1 × 10-7, and 1 × 10-8). The GA yielded the following number of significant SNP pairs for these values of α: seven, three, and zero significant pairs for BCRA1; nine, zero, and zero pairs for EP300; and 1284, 319, and 50 pairs for TAF15.
The eQTLs identified in the interaction analysis can be further investigated. For example, 65 unique eQTLs were identified for TAF15 from out of the 50 significant SNP pairs (p < 1 × 10-7). Eleven of these eQTLs are located in genic regions. Additionally, we examined whether functional groups are overrepresented in the eQTLs by gene ontology (GO) analysis using GOstat  to identify overrepresented elements within the 11 gene-containing eQTLs. GOstat performs Fisher's exact test assuming the hypergeometric distribution. In our analysis of the eQTL regions, the corresponding genes significantly overrepresented protein-binding functions (p = 0.038). This illustrates how statistical interaction analysis can provide a useful clue to study the biological interaction.
Comparison of genetic algorithm and exhaustive search
We first analyzed SNPs for the presence of linkage disequilibrium (LD) blocks. When an LD block is defined by D' > 0.8 across consecutive SNPs, the block had two SNPs on average. This LD block size information was used in the local search portion of the GA.
The number of GA evaluations to obtain one of the ten most significant interactions
8.97 × 10-7
2.01 × 10-6
2.23 × 10-6
2.46 × 10-6
4.33 × 10-6
9.89 × 10-6
8.97 × 10-7
4.33 × 10-7
7.47 × 10-7
8.15 × 10-7
4.01 × 10-7
8.15 × 10-7
8.49 × 10-9
4.11 × 10-9
1.6 × 10-9
5.53 × 10-9
5.43 × 10-9
6.21 × 10-10
Conclusion and discussion
In this study, we applied a GA to detect eQTL interactions, which showed comparable performance to an exhaustive search with a smaller number of evaluations. The reduction in computing time becomes greater as the search space becomes larger (looking forward to the case of 500 K genome-wide genotype data). Implementation of a local search makes it possible to reduce the computation time more dramatically as marker density increases. However, the GA does not guarantee a global optimum, in general. Carlborg et al. (2000) examined this issue in a simulation study, comparing a GA with exhaustive search and a two-stage search for different types of genetic interaction models. They showed the GA has almost as high an efficiency as exhaustive search for all interaction models they examined. In practical terms, the GA can be used to provide at least suboptimal solutions with a much lower computational burden.
Genome-wide interaction analysis using the GA enables us to identify pairs of SNPs that do not have individual marginal effects. The identified SNP pairs can be further examined with previously known biological information. In the example of TAF15 gene, we showed that the identified loci may affect the trait through biological interactions identified in a GO analysis.
We can improve the performance of genome-wide GA searches for the higher-order SNP interactions by incorporating biological information, such as biological pathways, protein-protein interactions, and linkage results. In particular, pathway information may provide the most useful prior knowledge for reducing the computation time. As an example, there was a report on interactions of genetic variants of genes in the same pathway affecting a psychiatric disease .
In our study, we used only one individual per family to satisfy the independence assumption of ANOVA models. As a result, the number of subjects was not large, which may have caused a lack of power. Thus, it is desirable to develop a statistical model that accounts for family structure when testing for interactions, so that all individuals in a given data set are included in the analysis.
This work was supported by the National Research Laboratory Program of Korea Science and Engineering Foundation (M10500000126).
This article has been published as part of BMC Proceedings Volume 1 Supplement 1, 2007: Genetic Analysis Workshop 15: Gene Expression Analysis and Approaches to Detecting Multiple Functional Loci. The full contents of the supplement are available online at http://www.biomedcentral.com/1753-6561/1?issue=S1.
- Morley M, Molony CM, Weber TM, Devlin JL, Ewens KG, Spielman RS, Cheung VG: Genetic analysis of genome-wide variation in human gene expression. Nature. 2004, 430: 743-747. 10.1038/nature02797.View ArticlePubMed CentralPubMedGoogle Scholar
- Wolf JB, Brodie ED, Wade MJ: Epistatsis and the Evolutionary Process. 2000, New York: Oxford University PressGoogle Scholar
- Evans DM, Marchini J, Morris AP, Cardon LR: Two-stage two-locus models in genome-wide association. PLoS Genet. 2006, 2: e157-10.1371/journal.pgen.0020157.View ArticlePubMed CentralPubMedGoogle Scholar
- Holland J: Adaptation in Neural and Artificial Systems. 1975, Ann Arbor: The University of Michigan PressGoogle Scholar
- Goldberg DE: Genetic Algorithm in Search, Optimization and Machine Learning. 1989, Reading: Addison and WesleyGoogle Scholar
- Carlborg O, Andersson L, Kinghorn B: The use of a genetic algorithm for simultaneous mapping of multiple interacting quantitative trait loci. Genetics. 2000, 155: 2003-2010.PubMed CentralPubMedGoogle Scholar
- Beissbarth T, Speed TP: GOstat: find statistically overrepresented gene ontologies within a group of genes. Bioinformatics. 2004, 20: 1464-1465. 10.1093/bioinformatics/bth088.View ArticlePubMedGoogle Scholar
- Xu Q, Jia YB, Zhang BY, Zou K, Tao YB, Wang YP, Qiang BQ, Wu GY, Shen Y, Ji HK, Huang Y, Sun XQ, Ji L, Li YD, Yuan YB, Shu L, Yu X, Shen YC, Yu YQ, Ju GZ, Chinese Schizophrenia Consortium: Association study of an SNP combination pattern in the dopaminergic pathway in paranoid schizophrenia: a novel strategy for complex disorders. Mol Psychiatry. 2004, 9: 510-521. 10.1038/sj.mp.4001472.View ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.