SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies

Although genome-wide association studies play an increasingly important role in identifying causes of complex diseases, detecting SNP epistasis in these studies is a computational challenge. The existing methods are usually based on a single-correlation model between SNP combinations and phenotype a...

Full description

Bibliographic Details
Main Authors: Liyan Sun, Guixia Liu, Lingtao Su, Rongquan Wang
Format: Article
Language:English
Published: Taylor & Francis Group 2019-01-01
Series:Biotechnology & Biotechnological Equipment
Subjects:
Online Access:http://dx.doi.org/10.1080/13102818.2019.1593052
_version_ 1818939517284909056
author Liyan Sun
Guixia Liu
Lingtao Su
Rongquan Wang
author_facet Liyan Sun
Guixia Liu
Lingtao Su
Rongquan Wang
author_sort Liyan Sun
collection DOAJ
description Although genome-wide association studies play an increasingly important role in identifying causes of complex diseases, detecting SNP epistasis in these studies is a computational challenge. The existing methods are usually based on a single-correlation model between SNP combinations and phenotype and their performance is often unsatisfactory. The highest average power of the existing methods is 0.58 on DME models and 0.97 on DNME models. The highest average F-measure of the existing methods is 0.44 on DME models and 0.90 on DNME models. The lowest average computation time (second) of the existing methods is 2.12 on DME models and 2.09 on DNME models. In this work, a novel multi-objective evolutionary algorithm named SEE is presented for identifying SNP epistasis. In SEE, eight evolution objectives are successfully integrated to measure the association between SNP combinations and phenotype. SEE uses a novel evolutionary strategy based on sort, exploration and exploitation. SEE was compared with other existing methods using 72 simulated datasets. The average power of SEE is 0.71 with DME models and 0.99 with DNME models. The average F-measure of SEE is 0.68 with DME models and 0.99 with DNME models. The average computation time of SEE is 0.21 with DME models and 0.40 with DNME models. It is indicated that SEE outperforms other algorithms in both F-measure and computation time. It was then utilized to analyze real data obtained from the Wellcome Trust Case Control Consortium. Availability and Implementation: SEE is freely available at https://github.com/sunliyan0000/SEE.
first_indexed 2024-12-20T06:25:00Z
format Article
id doaj.art-719ddf6cc41c4b4da9d165e88139fdac
institution Directory Open Access Journal
issn 1310-2818
1314-3530
language English
last_indexed 2024-12-20T06:25:00Z
publishDate 2019-01-01
publisher Taylor & Francis Group
record_format Article
series Biotechnology & Biotechnological Equipment
spelling doaj.art-719ddf6cc41c4b4da9d165e88139fdac2022-12-21T19:50:20ZengTaylor & Francis GroupBiotechnology & Biotechnological Equipment1310-28181314-35302019-01-0133152954710.1080/13102818.2019.15930521593052SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studiesLiyan Sun0Guixia Liu1Lingtao Su2Rongquan Wang3Jilin UniversityJilin UniversityJilin UniversityJilin UniversityAlthough genome-wide association studies play an increasingly important role in identifying causes of complex diseases, detecting SNP epistasis in these studies is a computational challenge. The existing methods are usually based on a single-correlation model between SNP combinations and phenotype and their performance is often unsatisfactory. The highest average power of the existing methods is 0.58 on DME models and 0.97 on DNME models. The highest average F-measure of the existing methods is 0.44 on DME models and 0.90 on DNME models. The lowest average computation time (second) of the existing methods is 2.12 on DME models and 2.09 on DNME models. In this work, a novel multi-objective evolutionary algorithm named SEE is presented for identifying SNP epistasis. In SEE, eight evolution objectives are successfully integrated to measure the association between SNP combinations and phenotype. SEE uses a novel evolutionary strategy based on sort, exploration and exploitation. SEE was compared with other existing methods using 72 simulated datasets. The average power of SEE is 0.71 with DME models and 0.99 with DNME models. The average F-measure of SEE is 0.68 with DME models and 0.99 with DNME models. The average computation time of SEE is 0.21 with DME models and 0.40 with DNME models. It is indicated that SEE outperforms other algorithms in both F-measure and computation time. It was then utilized to analyze real data obtained from the Wellcome Trust Case Control Consortium. Availability and Implementation: SEE is freely available at https://github.com/sunliyan0000/SEE.http://dx.doi.org/10.1080/13102818.2019.1593052single-nucleotide polymorphismepistasisgenome-wide association studiesevolutionary algorithm
spellingShingle Liyan Sun
Guixia Liu
Lingtao Su
Rongquan Wang
SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies
Biotechnology & Biotechnological Equipment
single-nucleotide polymorphism
epistasis
genome-wide association studies
evolutionary algorithm
title SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies
title_full SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies
title_fullStr SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies
title_full_unstemmed SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies
title_short SEE: a novel multi-objective evolutionary algorithm for identifying SNP epistasis in genome-wide association studies
title_sort see a novel multi objective evolutionary algorithm for identifying snp epistasis in genome wide association studies
topic single-nucleotide polymorphism
epistasis
genome-wide association studies
evolutionary algorithm
url http://dx.doi.org/10.1080/13102818.2019.1593052
work_keys_str_mv AT liyansun seeanovelmultiobjectiveevolutionaryalgorithmforidentifyingsnpepistasisingenomewideassociationstudies
AT guixialiu seeanovelmultiobjectiveevolutionaryalgorithmforidentifyingsnpepistasisingenomewideassociationstudies
AT lingtaosu seeanovelmultiobjectiveevolutionaryalgorithmforidentifyingsnpepistasisingenomewideassociationstudies
AT rongquanwang seeanovelmultiobjectiveevolutionaryalgorithmforidentifyingsnpepistasisingenomewideassociationstudies