A hybrid clustering and graph based algorithm for tagSNP selection |
| |
Authors: | Mao-Zu Guo Jun Wang Chun-yu Wang Yang Liu |
| |
Affiliation: | (1) School of Computer Science and Technology, Harbin Institute of Technology, 150001 Harbin, Heilongjiang, China |
| |
Abstract: | TagSNP selection, which aims to select a small subset of informative single nucleotide polymorphisms (SNPs) to represent the
whole large SNP set, has played an important role in current genomic research. Not only can this cut down the cost of genotyping
by filtering a large number of redundant SNPs, but also it can accelerate the study of genome-wide disease association. In
this paper, we propose a new hybrid method called CMDStagger that combines the ideas of the clustering and the graph algorithm,
to find the minimum set of tagSNPs. The proposed algorithm uses the information of the linkage disequilibrium association
and the haplotype diversity to reduce the information loss in tagSNP selection, and has no limit of block partition. The approach
is tested on eight benchmark datasets from Hapmap and chromosome 5q31. Experimental results show that the algorithm in this
paper can reduce the selection time and obtain less tagSNPs with high prediction accuracy. It indicates that this method has
better performance than previous ones. |
| |
Keywords: | TagSNP selection Clustering algorithm Maximum density subgraph (MDS) Linkage disequilibrium (LD) Haplotypes diversity |
本文献已被 SpringerLink 等数据库收录! |
|