• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

Algorithms for optical mapping.

作者信息

Karp R M, Shamir R

机构信息

Department of Electrical Engineering and Computer Sciences, University of California, Berkeley 94720, USA.

出版信息

J Comput Biol. 2000 Feb-Apr;7(1-2):303-16. doi: 10.1089/10665270050081540.

DOI:10.1089/10665270050081540
PMID:10890404
Abstract

Optical mapping is a novel technique for determining the restriction sites on a DNA molecule by directly observing a number of partially digested copies of the molecule under a light microscope. The problem is complicated by uncertainty as to the orientation of the molecules and by erroneous detection of cuts. In this paper we study the problem of constructing a restriction map based on optical mapping data. We give several variants of a polynomial reconstruction algorithm, as well as an algorithm that is exponential in the number of cut sites, and hence is appropriate only for small number of cut sites. We give a simple probabilistic model for data generation and for the errors and prove probabilistic upper and lower bounds on the number of molecules needed by each algorithm in order to obtain a correct map, expressed as a function of the number of cut sites and the error parameters. To the best of our knowledge, this is the first probabilistic analysis of algorithms for the problem. We also provide experimental results confirming that our algorithms are highly effective on simulated data.

摘要

相似文献

1
Algorithms for optical mapping.
J Comput Biol. 2000 Feb-Apr;7(1-2):303-16. doi: 10.1089/10665270050081540.
2
An algorithm combining discrete and continuous methods for optical mapping.一种结合离散和连续方法的光学图谱算法。
J Comput Biol. 2000;7(5):745-60. doi: 10.1089/106652701446189.
3
An algorithm combining discrete and continuous methods for optical mapping.一种结合离散和连续方法的光学图谱算法。
Proc Int Conf Intell Syst Mol Biol. 1999:159-68.
4
Hardness of flip-cut problems from optical mapping.光学图谱中翻转切割问题的难度。
J Comput Biol. 1997 Summer;4(2):119-25. doi: 10.1089/cmb.1997.4.119.
5
Estimation for restriction sites observed by optical mapping using reversible-jump Markov Chain Monte Carlo.使用可逆跳跃马尔可夫链蒙特卡罗法通过光学图谱对限制性酶切位点进行估计。
J Comput Biol. 1998 Fall;5(3):505-15. doi: 10.1089/cmb.1998.5.505.
6
A uniform framework for ordered restriction map problems.有序限制图谱问题的统一框架。
J Comput Biol. 1998 Winter;5(4):725-39. doi: 10.1089/cmb.1998.5.725.
7
Genomics via optical mapping. II: Ordered restriction maps.
J Comput Biol. 1997 Summer;4(2):91-118. doi: 10.1089/cmb.1997.4.91.
8
An EM-type Algorithm for Ordered Restriction Map Alignment.一种用于有序限制图谱比对的期望最大化(EM)型算法。
Genome Inform Ser Workshop Genome Inform. 1999;10:62-72.
9
An exponential example for a partial digest mapping algorithm.一个用于部分酶切图谱算法的指数示例。
J Comput Biol. 1994 Fall;1(3):235-9. doi: 10.1089/cmb.1994.1.235.
10
Construction of DNA restriction maps based on a simplified experiment.基于简化实验构建DNA限制酶切图谱。
Bioinformatics. 2001 May;17(5):398-404. doi: 10.1093/bioinformatics/17.5.398.