Table

Table 1. The Carlson “greedy” algorithm for tagSNP selection

1. Define MAF threshold = M.
2. Identify all SNPs with MAF > M.
3. Calculate pairwise r2 values for all included SNPs.
4. Define r2 threshold = R.
5. Identify all pairwise associations where r2 > R.
6. Identify SNP with highest number of associations with r2 > R.
7. Extract the SNP from Step 6 and all additional SNPs captured for evaluation.
8. Examine pairwise r2 for the subset of extracted SNPs.
9. All SNPs with r2 > R with all other extracted SNPs are potential tagSNPs.
10. Select a single tagSNP from the set of potential tagSNPs (potentially including information about biology, ease of genotyping, or other ranking criteria).
11. Repeat from Step 5, restricting considerations to untagged SNPs.
12. Any SNPs not captured by other SNPs are defined as singletons.
| Table of Contents

This Article

  1. doi:10.1101/pdb.tab1top74 Cold Spring Harb Protoc 2010: pdb.tab1top74-

Article Category

  1. Table

Personal Folder

  1. Save to Personal Folders

Updates/Comments

  1. Alert me when Updates/Comments are published

Share