首页> 外文会议>Algorithms in Bioinformatics >Placing Probes along the Genome Using Pairwise Distance Data
【24h】

Placing Probes along the Genome Using Pairwise Distance Data

机译:使用成对距离数据沿基因组放置探针

获取原文

摘要

We describe the theoretical basis of an approach using microarrays of probes and libraries of BACs to construct maps of the probes, by assigning relative locations to the probes along the genome. The method depends on several hybridization experiments: in each experiment, we sample (with replacement) a large library of BACs to select a small collection of BACs for hybridization with the probe arrays. The resulting data can be used to assign a local distance metric relating the arrayed probes, and then to position the probes with respect to each other. The method is shown to be capable of achieving surprisingly high accuracy within individual contigs and with less than 100 microarray hybridization experiments even when the probes and clones number about 10~5, thus involving potentially around 10~(10) individual hybridizations. This approach is not dependent upon existing BAC contig information, and so should be particularly useful in the application to previously uncharacterized genomes. Nevertheless, the method may be used to independently validate a BAC contig map or a minimal tiling path obtained by intensive genornic sequence determination. We provide a detailed probabilistic analysis to characterize the outcome of a single hybridization experiment and what information can be garnered about the physical distance between any pair of probes. This analysis then leads to a formulation of a likelihood optimization problem whose solution leads to the relative probe locations. After reformulating the optimization problem in a graph-theoretic setting and by exploiting the underlying probabilistic structure, we develop an efficient approximation algorithm for our original problem. We have implemented the algorithm and conducted several experiments for varied sets of parameters. Our empirical results are highly promising and are reported here as well. We also explore how the probabilistic analysis and algorithmic efficiency issues affect the design of the underlying biochemical experiments.
机译:我们描述了一种方法的理论基础,该方法使用了探针的微阵列和BAC的文库以通过沿基因组分配相对位置给探针来构建探针图。该方法取决于几个杂交实验:在每个实验中,我们取样(并替换)大的BAC库以选择少量的BAC与探针阵列杂交。所得数据可用于分配与阵列探针相关的局部距离度量,然后相对于彼此放置探针。结果表明,该方法即使在探针和克隆数约为10〜5的情况下,也能在单个重叠群内实现惊人的高精度,并且少于100个微阵列杂交实验,因此可能涉及约10〜(10)个单独杂交。该方法不依赖于现有的BAC重叠群信息,因此在应用于以前未表征的基因组中应特别有用。然而,该方法可用于独立地验证通过密集的基因组序列确定获得的BAC重叠群图或最小拼接路径。我们提供了详细的概率分析,以表征单个杂交实验的结果以及可以获取有关任何一对探针之间的物理距离的信息。然后,该分析导致了似然性优化问题的表述,其解决方案导致了相对的探针位置。在图论设置中重新优化问题并通过利用潜在的概率结构后,我们为原始问题开发了一种有效的近似算法。我们已经实现了该算法,并针对各种参数集进行了几次实验。我们的经验结果非常有前途,这里也有报道。我们还将探讨概率分析和算法效率问题如何影响基础生化实验的设计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号