首页> 外文会议>Eighth Pacific Symposium on Biocomputing (PSB), Jan 3-7, 2003, Kauai, Hawaii >SELECTION OF MINIMUM SUBSETS OF SINGLE NUCLEOTIDE POLYMORPHISMS TO CAPTURE HAPLOTYPE BLOCK DIVERSITY
【24h】

SELECTION OF MINIMUM SUBSETS OF SINGLE NUCLEOTIDE POLYMORPHISMS TO CAPTURE HAPLOTYPE BLOCK DIVERSITY

机译:单个核苷酸多态性子集的最小子集的选择以捕获表型多样性

获取原文
获取原文并翻译 | 示例

摘要

We present a simple numerical algorithm to select the minimal subset of SNPs required to capture the diversity of haplotype blocks or other genetic loci. This algorithm can be used to quickly select the minimum SNP subset with no loss of haplotype information. In addition, the method can be used in a more aggressive mode to further reduce the original SNP set, with minimal loss of information. We demonstrate the algorithm performance with data from over 11,000 SNPs with average spacing of 6 to 11 Kb, across all the genes of chromosomes 6, 21, and 22, genotyped on DNA samples of 45 unrelated African-Americans and 45 Caucasians from the Coriell Human Diversity Collection. With no loss of information, we reduced the number of SNPs required to capture the haplotype block diversity by 25% for the African-American and 36% for the Caucasian populations. With a maximum loss of 10% of haplotype distribution information, the SNP reduction was 38% and 49% respectively for the two populations. All computations were performed in less than 1 minute for the entire dataset used.
机译:我们提出一种简单的数值算法,以选择捕获单倍型基因组或其他遗传基因座的多样性所需的SNP的最小子集。该算法可用于快速选择最小SNP子集,而不会丢失单倍型信息。另外,该方法可以在更积极的模式下使用,以进一步减少原始SNP集,同时减少信息损失。我们通过对来自6个21、22和22号染色体的所有基因的来自超过11,000个SNP的数据进行证明,证明了算法的性能,这些基因在来自45位来自非裔美国人和45位来自科伊尔人类的高加索人的DNA样本中进行了基因分型多样性集合。在不丢失信息的情况下,我们将捕获单倍型模块多样性所需的SNP数量(非裔美国人)减少了25%,将白种人人口减少了36%。由于单倍型分布信息的最大损失为10%,两个人群的SNP降低分别为38%和49%。对于所使用的整个数据集,所有计算均在不到1分钟的时间内完成。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号