The Community for Technology Leaders
Green Image
Issue No. 03 - May-June (2013 vol. 10)
ISSN: 1545-5963
pp: 688-695
Xiong Li , Hunan University, Changsha
Bo Liao , Hunan University, Changsha
Lijun Cai , Hunan University, Changsha
Zhi Cao , Hunan University, Changsha
Wen Zhu , Hunan University, Changsha
Currently, there are lots of methods to select informative SNPs for haplotype reconstruction. However, there are still some challenges that render them ineffective for large data sets. First, some traditional methods belong to wrappers which are of high computational complexity. Second, some methods ignore linkage disequilibrium that it is hard to interpret selection results. In this study, we innovatively derive optimization criteria by combining two-locus and multilocus LD measure to obtain the criteria of MaxCorrelation and Min-Redundancy (MCMR). Then, we use a greedy algorithm to select the candidate set of informative SNPs constrained by the criteria. Finally, we use backward scheme to refine the candidate subset. We separately use small and middle (>1,000 SNPs) data sets to evaluate MCMR in terms of the reconstruction accuracy, the time complexity, and the compactness. Additionally, to demonstrate that MCMR is practical for large data sets, we design a parameter w to adapt to various platforms and introduce another replacement scheme for larger data sets, which sharply narrow down the computational complexity of evaluating the reconstruct ratio. Then, we first apply our method based on haplotype reconstruction for large size (>5,000 SNPs) data sets. The results confirm that MCMR leads to promising improvement in informative SNPs selection and prediction accuracy.
Accuracy, Time complexity, Greedy algorithms, Couplings, Prediction algorithms, Predictive models, Bioinformatics

X. Li, B. Liao, L. Cai, Z. Cao and W. Zhu, "Informative SNPs Selection Based on Two-Locus and Multilocus Linkage Disequilibrium: Criteria of Max-Correlation and Min-Redundancy," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 3, pp. 688-695, 2013.
390 ms
(Ver 3.3 (11022016))