CGTS: a site-clustering graph based tagSNP selection algorithm in genotype data.
BACKGROUND
Recent studies have shown genetic variation is the basis of the genome-wide disease association research. However, due to the high cost on genotyping large number of single nucleotide polymorphisms (SNPs), it is essential to choose a small subset of informative SNPs (tagSNPs), which are able to capture most variation in a population, to represent the rest SNPs. Several methods have been proposed to find the minimum set of tagSNPs, but most of them still have some disadvantages such as information loss and block-partition limit.


RESULTS
This paper proposes a new hybrid method named CGTS which combines the ideas of the clustering and the graph algorithms to select tagSNPs on genotype data. This method aims to maximize the number of the discarding nontagSNPs in the given set. CGTS integrates the information of the LD association and the genotype diversity using the site graphs, discards redundant SNPs using the algorithm based on these graph structures. The clustering algorithm is used to reduce the running time of CGTS. The efficiency of the algorithm and quality of solutions are evaluated on biological data and the comparisons with three popular selecting methods are shown in the paper.


CONCLUSIONS
Our theoretical analysis and experimental results show that our algorithm CGTS is not only more efficient than other methods but also can be get higher accuracy in tagSNP selection.
Wang
Jun
J
Department of Computer Science and Engineering, Harbin Institute of Technology, Harbin 150001, PR China. wjking@hit.edu.cn
Guo
Mao-zu
MZ
Wang
Chun-yu
CY
D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D005838:Genotype; D010363:Pattern Recognition, Automated / Q000379:methods; D020641:Polymorphism, Single Nucleotide / Q000235:genetics*