A double classification tree search algorithm for index SNP selection
Open Access
- 6 July 2004
- journal article
- software
- Published by Springer Nature in BMC Bioinformatics
- Vol. 5 (1) , 89
- https://doi.org/10.1186/1471-2105-5-89
Abstract
In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, groups of SNPs that tend to be coinherited. It is thus possible to choose a much smaller number of SNPs to use as indices for identifying haplotypes or haplotype blocks in genetic association studies. We refer to these characteristic SNPs as index SNPs. In order to reduce costs and work, a minimum number of index SNPs that can distinguish all SNP and haplotype patterns should be chosen. Unfortunately, this is an NP-complete problem, requiring brute force algorithms that are not feasible for large data sets. We have developed a double classification tree search algorithm to generate index SNPs that can distinguish all SNP and haplotype patterns. This algorithm runs very rapidly and generates very good, though not necessarily minimum, sets of index SNPs, as is to be expected for such NP-complete problems. A new algorithm for index SNP selection has been developed. A webserver for index SNP selection is available at http://cognia.cu-genome.org/cgi-bin/genome/snpIndex.cgi/This publication has 4 references indexed in Scilit:
- Minimal haplotype taggingProceedings of the National Academy of Sciences, 2003
- HapScope: a software system for automated and visual analysis of functionally annotated haplotypesNucleic Acids Research, 2002
- Haplotype tagging for the identification of common disease genesNature Genetics, 2001
- An algorithm based on graph theory for the assembly of contigs in physical mapping of DNABioinformatics, 1994