• 我要登录|
  • 免费注册
    |
  • 我的丁香通
    • 企业机构:
    • 成为企业机构
    • 个人用户:
    • 个人中心
  • 移动端
    移动端
丁香通 logo丁香实验_LOGO
搜实验

    大家都在搜

      大家都在搜

        0 人通过求购买到了急需的产品
        免费发布求购
        发布求购
        点赞
        收藏
        wx-share
        分享

        GCG: Drawing Linear Restriction Maps

        互联网

        741
        To produce a restriction map using a computer program a single sequence (your target sequence) is matched against a predefined sequence pattern database (referred to as “enzymes”). The pattern database used must obey some rules with respect to the pattern definition language, and what an individual pattern means. The pattern matching algorithm should be flexible enough to allow modifications to its stringency. With respect to enzyme cleavage, this is fairly easy to achieve in nucleotide sequences, as described in this chapter. It becomes more difficult when dealing with protein sequences (see Chapter 12 and Chapters 12 and 13 in Part II). Pattern matching methods are important in many other fields and are not necessarily restricted to enzyme cleavage (see Chapter 10 and Chapters 8 and 9 in Part II).
        ad image
        提问
        扫一扫
        丁香实验小程序二维码
        实验小助手
        丁香实验公众号二维码
        扫码领资料
        反馈
        TOP
        打开小程序