Spatially Uniform ReliefF (SURF) for computationally-efficient filtering of gene-gene interactions Export

@article{citeulike:5938473, abstract = {BACKGROUND:Genome-wide association studies are becoming the de facto standard in the genetic analysis of common human diseases. Given the complexity and robustness of biological networks such diseases are unlikely to be the result of single points of failure but instead likely arise from the joint failure of two or more interacting components. The hope in genome-wide screens is that these points of failure can be linked to single nucleotide polymorphisms (SNPs) which confer disease susceptibility. Detecting interacting variants that lead to disease in the absence of single-gene effects is difficult however, and methods to exhaustively analyze sets of these variants for interactions are combinatorial in nature thus making them computationally infeasible. Efficient algorithms which can detect interacting SNPs are needed. ReliefF is one such promising algorithm, although it has low success rate for noisy datasets when the interaction effect is small. ReliefF has been paired with an iterative approach, Tuned ReliefF (TuRF), which improves the estimation of weights in noisy data but does not fundamentally change the underlying ReliefF algorithm. To improve the sensitivity of studies using these methods to detect small effects we introduce Spatially Uniform ReliefF (SURF).RESULTS:SURF's ability to detect interactions in this domain is significantly greater than that of ReliefF. Similarly SURF, in combination with the TuRF strategy significantly outperforms TuRF alone for SNP selection under an epistasis model. It is important to note that this success rate increase does not require an increase in algorithmic complexity and allows for increased success rate, even with the removal of a nuisance parameter from the algorithm.CONCLUSION:Researchers performing genetic association studies and aiming to discover gene-gene interactions associated with increased disease susceptibility should use SURF in place of ReliefF. For instance, SURF should be used instead of ReliefF to filter a dataset before an exhaustive MDR analysis. This change increases the ability of a study to detect gene-gene interactions. The SURF algorithm is implemented in the open source Multifactor Dimensionality Reduction (MDR) software package available from http://www.epistasis.org.}, author = {Greene, Casey and Penrod, Nadia and Kiralis, Jeff and Moore, Jason}, citeulike-article-id = {5938473}, citeulike-linkout-0 = {http://dx.doi.org/10.1186/1756-0381-2-5}, citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/19772641}, citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=19772641}, doi = {10.1186/1756-0381-2-5}, issn = {1756-0381}, journal = {BioData Mining}, keywords = {gene-gene, literaturemining, ppi, textmining}, number = {1}, pages = {5+}, posted-at = {2009-10-14 08:34:46}, priority = {2}, title = {Spatially Uniform ReliefF (SURF) for computationally-efficient filtering of gene-gene interactions}, url = {http://dx.doi.org/10.1186/1756-0381-2-5}, volume = {2}, year = {2009} }

TY - JOUR ID - citeulike:5938473 L3 - citeulike-article-id:5938473 N2 - BACKGROUND:Genome-wide association studies are becoming the de facto standard in the genetic analysis of common human diseases. Given the complexity and robustness of biological networks such diseases are unlikely to be the result of single points of failure but instead likely arise from the joint failure of two or more interacting components. The hope in genome-wide screens is that these points of failure can be linked to single nucleotide polymorphisms (SNPs) which confer disease susceptibility. Detecting interacting variants that lead to disease in the absence of single-gene effects is difficult however, and methods to exhaustively analyze sets of these variants for interactions are combinatorial in nature thus making them computationally infeasible. Efficient algorithms which can detect interacting SNPs are needed. ReliefF is one such promising algorithm, although it has low success rate for noisy datasets when the interaction effect is small. ReliefF has been paired with an iterative approach, Tuned ReliefF (TuRF), which improves the estimation of weights in noisy data but does not fundamentally change the underlying ReliefF algorithm. To improve the sensitivity of studies using these methods to detect small effects we introduce Spatially Uniform ReliefF (SURF).RESULTS:SURF's ability to detect interactions in this domain is significantly greater than that of ReliefF. Similarly SURF, in combination with the TuRF strategy significantly outperforms TuRF alone for SNP selection under an epistasis model. It is important to note that this success rate increase does not require an increase in algorithmic complexity and allows for increased success rate, even with the removal of a nuisance parameter from the algorithm.CONCLUSION:Researchers performing genetic association studies and aiming to discover gene-gene interactions associated with increased disease susceptibility should use SURF in place of ReliefF. For instance, SURF should be used instead of ReliefF to filter a dataset before an exhaustive MDR analysis. This change increases the ability of a study to detect gene-gene interactions. The SURF algorithm is implemented in the open source Multifactor Dimensionality Reduction (MDR) software package available from http://www.epistasis.org. IS - 1 JF - BioData Mining SN - 1756-0381 TI - Spatially Uniform ReliefF (SURF) for computationally-efficient filtering of gene-gene interactions VL - 2 SP - 5 KW - gene-gene KW - literaturemining KW - ppi KW - textmining AU - Greene, Casey AU - Penrod, Nadia AU - Kiralis, Jeff AU - Moore, Jason PY - 2009/// UR - http://dx.doi.org/10.1186/1756-0381-2-5 ER -