CLUSTAG: hierarchical clustering and graph methods for selecting tag SNPs

Open Access

7 December 2004

journal article
research article
Published by Oxford University Press (OUP) in Bioinformatics

Vol. 21 (8) , 1735-1736
https://doi.org/10.1093/bioinformatics/bti201

Abstract

Summary: Cluster and set-cover algorithms are developed to obtain a set of tag single nucleotide polymorphisms (SNPs) that can represent all the known SNPs in a chromosomal region, subject to the constraint that all SNPs must have a squared correlation R² > C with at least one tag SNP, where C is specified by the user. Availability:http://hkumath.hku.hk/web/link/CLUSTAG/CLUSTAG.html Contact:mng@maths.hku.hk

Keywords

This publication has 6 references indexed in Scilit:

Approximating the dense set-cover problem
Journal of Computer and System Sciences, 2004
Haploview: analysis and visualization of LD and haplotype maps
Bioinformatics, 2004
Selecting a Maximally Informative Set of Single-Nucleotide Polymorphisms for Association Analyses Using Linkage Disequilibrium
American Journal of Human Genetics, 2004
SNP Subset Selection for Genetic Association Studies
Annals of Human Genetics, 2003
Haplotype tagging for the identification of common disease genes
Nature Genetics, 2001