【24h】

Properties of linkage disequilibrium (LD) maps

机译:连锁不平衡图的性质

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

摘要

A linkage disequilibrium map is expressed in linkage disequilibrium (LD) units (LDU) discriminating blocks of conserved LD that have additive distances and locations monotonic with physical (kb) and genetic (cM) maps. There is remarkable agreement between LDU steps and sites of meiotic recombination in the one body of data informative for crossing over, and good agreement with another method that defines blocks without assigning an LD location to each marker. The map may be constructed from haplotypes or diplotypes, and efficiency estimated from the empirical variance of LD is substantially greater for the ρ metric based on evolutionary theory than for the absolute correlation r, and for the LD map compared with its physical counterpart. The empirical variance is nearly three times as great for the worst alternative (rand kb map) as for the most efficient approach (ρ and LD map). According to the empirical variances, blocks are best defined 'by zero distance between included markers. Because block size is algorithm-dependent and highly variable, the number of markers required for positional cloning is minimized by uniform spacing on the LD map, which is estimated to have ≈1 LDU per locus, but with much variation among regions. No alternative representation of linkage disequilibrium (some of which are loosely called maps) has these properties, suggesting that LD maps are optimal for positional cloning of genes determining disease susceptibility.
机译:连锁不平衡图以区分连锁保守LD的连锁不平衡(LD)单位(LDU)表示,其距离和映射与物理图谱(kb)和遗传图谱(cM)具有单调性。 LDU步骤与减数分裂重组位点之间具有显着的一致性,可为交叉提供有用的数据,并且与另一种定义块而无需为每个标记分配LD位置的方法具有很好的一致性。该图可以由单倍型或双倍型构建,并且基于进化论的ρ度量从LD的经验方差估计的效率要比绝对相关r大得多,对于LD映射,与其物理对应物相比,效率要高得多。对于最差的选择(rand kb图),经验方差几乎是最有效的方法(ρ和LD图)的三倍。根据经验差异,最好通过所包含标记之间的零距离来定义块。由于块大小取决于算法,并且高度可变,因此通过LD映射上的均匀间隔,可以将位置克隆所需的标记数最小化,据估计每个位点具有≈1LDU,但区域间差异很大。连锁不平衡的替代表示法(其中有些被宽松地称为“ maps”)没有这些特性,这表明LD maps对于确定疾病易感性的基因的位置克隆是最佳的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号