Incorporating heuristic information into ant colony optimization for epistasis detection

Epistasis has been receiving increasing attention in understanding the mechanism underlying susceptibility to complex diseases. Though many works have been done for epistasis detection, genome-wide association study remains a challenging task: it makes the search space excessively huge while solution quality is excessively demanded. In this study, we introduce an ant colony optimization based algorithm, AntMiner, by incorporating heuristic information into ant-decision rules. The heuristic information is used to direct ants in the search process for improving computational efficiency and solution accuracy. During iterations, chi-squared test is conducted to measure the association between an interaction and the phenotype. At the completion of the iteration process, statistically significant epistatic interactions are ordered and then screened by a post-procedure. Experiments of AntMiner and its comparison with existing algorithms epiMODE, TEAM and AntEpiSeeker are performed on both simulation data sets and real age-related macular degeneration data set, under the criteria of detection power and sensitivity. Results demonstrate that AntMiner is promising for epistasis detection. In terms of detection power, AntMiner performs best among all the other algorithms on all cases regardless of epistasis models and single nucleotide polymorphism size; compared with AntEpiSeeker, AntMiner can obtain better detection power but with less ants and iterations. In terms of sensitivity, AntMiner is better than AntEpiSeeker in detecting epistasis models displaying marginal effects but it has moderate sensitivity on epistasis models displaying no marginal effects. The study may provide clues on heuristics for further epistasis detection. The software package is available online at https://sourceforge.net/projects/antminer/files/.