AN APPROXIMATE GREEDY ALGORITHM FOR TAGSNP SELECTION USING LINKAGE DISEQUILIBRIUM CRITERIA

  • Wang, Ying (Department of Applied Mathematics, Dalian University of Technology) ;
  • Feng, Enmin (Department of Applied Mathematics, Dalian University of Technology) ;
  • Wang, Ruisheng (School of Information, Renmin University of China)
  • Published : 2008.05.31

Abstract

In this paper, we first construct a mathematical model for tagSNP selection based on LD measure $r^2$, then aiming at this kind of model, we develop an efficient algorithm, which is called approximate greedy algorithm. This algorithm is able to make up the disadvantage of the greedy algorithm for tagSNP selection. The key improvement of our approximate algorithm over greedy algorithm lies in that it adds local replacement(or local search) into the greedy search, tagSNP is replaced with the other SNP having greater similarity degree with it, and the local replacement is performed several times for a tagSNP so that it can improve the tagSNP set of the local precinct, thereby improve tagSNP set of whole precinct. The computational results prove that our approximate greedy algorithm can always find more efficient solutions than greedy algorithm, and improve the tagSNP set of whole precinct indeed.