Detecting genome-wide epistases based on the clustering of relatively frequent items.
Where this comes from
- Record sourced from PubMed, PMID 22053078.
- Also identified by DOI 10.1093/bioinformatics/btr603 and PMC identifier 3244765.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
In genome-wide association studies (GWAS), up to millions of single nucleotide polymorphisms (SNPs) are genotyped for thousands of individuals. However, conventional single locus-based approaches are usually unable to detect gene-gene interactions underlying complex diseases. Due to the huge search space for complicated high order interactions, many existing multi-locus approaches are slow and may suffer from low detection power for GWAS. In this article, we develop a simple, fast and effective algorithm to detect genome-wide multi-locus epistatic interactions based on the clustering of relatively frequent items. Extensive experiments on simulated data show that our algorithm is fast and more powerful in general than some recently proposed methods. On a real genome-wide case-control dataset for age-related macular degeneration (AMD), the algorithm has identified genotype combinations that are significantly enriched in the cases. http://www.cs.ucr.edu/~minzhux/EDCF.zip minzhux@cs.ucr.edu; jingli@cwru.edu Supplementary data are available at Bioinformatics online.
Medical subject headings
- Algorithms
- Epistasis, Genetic
- Genome-Wide Association Study