...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >Probe location in the presence of errors: a problem from DNA mapping
【24h】

Probe location in the presence of errors: a problem from DNA mapping

机译：存在错误时的探针定位：DNA定位产生的问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the problem of mapping probes to locations along the genome given noisy pairwise distance data as input. The model used is quite general: The input consists of a collection of probe pairs and a distance interval for the genomic distance separating each pair. We call this the probe-location problem. Because the distance intervals are only known with some confidence level, some may be erroneous and must be identified and removed in order to find a consistent map. This is cast as the gang-filtering problem. To the author's knowledge, this is a previously unstudied combinatorial problem that can be viewed as a generalization of classical group testing. A randomized algorithm for this problem is proposed, All the algorithms were implemented and experimental results were collected for synthetic data sets (with and without errors) and real data from a region of human chromosome 4. (C) 2000 Elsevier Science B.V. All rights reserved. [References: 10]
机译：我们考虑在给定嘈杂的成对距离数据作为输入的情况下将探针映射到基因组位置的问题。所使用的模型非常笼统：输入包括一组探针对和一个将每对探针隔开的基因组距离的距离间隔。我们称其为探针定位问题。因为仅以一定的置信度知道距离间隔，所以某些间隔可能是错误的，必须进行识别和删除才能找到一致的地图。这被认为是帮派过滤问题。据作者所知，这是一个以前尚未研究的组合问题，可以看作是经典组测试的概括。提出了针对该问题的随机算法，实施了所有算法，并收集了来自人类第4染色体区域的合成数据集（有无错误）和真实数据的实验结果。（C）2000 Elsevier Science BV保留所有权利。 [参考：10]

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号