• DocumentCode
    568189
  • Title

    A hybrid algorithm for LD tagSNPs selection

  • Author

    Chen, Hailin ; Zhang, Zuping ; Xia, Jing

  • fYear
    2012
  • fDate
    14-17 July 2012
  • Firstpage
    1219
  • Lastpage
    1222
  • Abstract
    Single Nucleotide Polymorphisms (SNPs) are widely used in Genome-wide Association Studies (GWAS). To reduce genotyping costs, several LD tagSNPs selection algorithms have been devised. In this paper, we proposed an improved hybrid algorithm HybridTag for LD tagSNPs selection. We first decomposed the genome into different precincts. For each precinct, we tried to use exhaustive search for tagSNPs selection. If it was not feasible, we then turned to a greedy algorithm for selecting tagSNPs. Using data downloaded from the HapMap Project, the performance of the algorithm is evaluated and compared with other tagging algorithms, our algorithm shows improvements in tagging efficiency.
  • Keywords
    biology computing; genomics; greedy algorithms; information retrieval; GWAS; HapMap Project; LD tagSNP selection; exhaustive search; genome-wide association studies; greedy algorithm; improved hybrid algorithm; single nucleotide polymorphisms; tagging algorithms; Algorithm design and analysis; Bioinformatics; Couplings; Genomics; Greedy algorithms; Partitioning algorithms; Tagging; SNPs; linkage disequilibrium; tagSNPs selection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science & Education (ICCSE), 2012 7th International Conference on
  • Conference_Location
    Melbourne, VIC
  • Print_ISBN
    978-1-4673-0241-8
  • Type

    conf

  • DOI
    10.1109/ICCSE.2012.6295284
  • Filename
    6295284