FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium

• Published in: BMC bioinformatics Vol. 11; no. 1; p. 66
• Main Authors: Liu, Guimei, Wang, Yue, Wong, Limsoon
• Format: Journal Article
• Language: English
• Published: London BioMed Central 29.01.2010; BioMed Central Ltd; BMC
• Subjects: Algorithms; Bioinformatics; Biomedical and Life Sciences; Chromosome abnormalities; Chromosome Mapping - methods; Computational Biology/Bioinformatics; Computer Appl. in Life Sciences; DNA Mutational Analysis - methods; Genetic algorithms; Genetic Markers - genetics; Life Sciences; Linkage Disequilibrium - genetics; Microarrays; Polymorphism, Single Nucleotide - genetics; Research Article; Single nucleotide polymorphisms; Software; Singapore; Phase Haplotype Data; Memory Consumption; Lagrangian Relaxation Algorithm; Redundant Rule; Pairwise Linkage Disequilibrium
• ISSN: 1471-2105; 1471-2105
• DOI: 10.1186/1471-2105-11-66

Background Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic variations and human diseases. Many SNPs show correlated genotypes, or linkage disequilibrium (LD), thus it is not necessary to genotype all SNPs for association study. Many algorithms have been developed to find a small subset of SNPs called tag SNPs that are sufficient to infer all the other SNPs. Algorithms based on the r 2 LD statistic have gained popularity because r 2 is directly related to statistical power to detect disease associations. Most of existing r 2 based algorithms use pairwise LD. Recent studies show that multi-marker LD can help further reduce the number of tag SNPs. However, existing tag SNP selection algorithms based on multi-marker LD are both time-consuming and memory-consuming. They cannot work on chromosomes containing more than 100 k SNPs using length-3 tagging rules. Results We propose an efficient algorithm called FastTagger to calculate multi-marker tagging rules and select tag SNPs based on multi-marker LD. FastTagger uses several techniques to reduce running time and memory consumption. Our experiment results show that FastTagger is several times faster than existing multi-marker based tag SNP selection algorithms, and it consumes much less memory at the same time. As a result, FastTagger can work on chromosomes containing more than 100 k SNPs using length-3 tagging rules. FastTagger also produces smaller sets of tag SNPs than existing multi-marker based algorithms, and the reduction ratio ranges from 3%-9% when length-3 tagging rules are used. The generated tagging rules can also be used for genotype imputation. We studied the prediction accuracy of individual rules, and the average accuracy is above 96% when r 2 ≥ 0.9. Conclusions Generating multi-marker tagging rules is a computation intensive task, and it is the bottleneck of existing multi-marker based tag SNP selection methods. FastTagger is a practical and scalable algorithm to solve this problem.