Parallel genetic algorithm for disease-gene association
After revealing the complete human genome, computational biology shifted towards the study of associations between complex diseases and genetic markers. Given that the number of human DNA variations, called single nucleotide polymorphisms (SNPs), account for a small percentage of the whole genome, a...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | conferenceObject |
| منشور في: |
2011
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/7853 http://dx.doi.org/10.1109/ICNC.2011.6022409 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/6022409/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | After revealing the complete human genome, computational biology shifted towards the study of associations between complex diseases and genetic markers. Given that the number of human DNA variations, called single nucleotide polymorphisms (SNPs), account for a small percentage of the whole genome, accurate and informative results have become possible. However, a major limitation in association studies is the cost of genotyping SNPs. Therefore, finding a small subset of tag SNPs to be used as good representatives of the rest of the SNPs is essential. In this work, we combine few successful strategies from the literature and present a parallel genetic algorithm for the Tag SNP Selection problem. Our results compared favorably with those of a recognized tag SNP selection algorithm using three different data sets from the HapMap project. |
|---|