QQ登录

只需要一步,快速开始

 注册地址  找回密码
查看: 28917|回复: 85
打印 上一主题 下一主题

每日科技报告 第84期 Scientists Identify DNA Contribute to Person's Uniqueness

[复制链接]
字体大小: 正常 放大
张立涛 实名认证       

280

主题

5

听众

2452

积分

  • TA的每日心情
    奋斗
    2015-10-7 09:09
  • 签到天数: 75 天

    [LV.6]常住居民II

    优秀斑竹奖

    群组西北工业大学

    群组Matlab讨论组

    群组狂热数模爱好者

    群组岩土力学与地下工程

    跳转到指定楼层
    #
    发表于 2010-8-13 23:59 |只看该作者 |正序浏览
    |招呼Ta 关注Ta
    Scientists Identify DNA That May Contribute to Each Person's Uniqueness

    ScienceDaily (Aug. 13, 2010) — Building on a tool that they developed in yeast four years ago, researchers at the Johns Hopkins University School of Medicine scanned the human genome and discovered what they believe is the reason people have such a variety of physical traits and disease risks.

    In a report published in the June 25 issue of Cell, the team identified a near complete catalog of the DNA segments that copy themselves, move around in, and insert themselves here and there in our genome. The insertion locations of these moveable segments -- transposons -- in each individual's genome helps determine why some are short or tall, blond or brunette, and more likely or less likely to have cancer or heart disease. The Johns Hopkins researchers say that tracking the locations of transposons in people with specific diseases might lead to the discovery of new disease genes or mutations.

    Using their specialized "chip" with DNA spots that contain all of the DNA sequences that appear in the genome, researchers applied human DNA from 15 unrelated people. The research team compared transposon sites first identified in the original published human "index" genome and found approximately 100 new transposon sites in each person screened.

    "We were surprised by how many novel insertions we were able to find," says Jef Boeke, Ph.D., Sc.D., an author on the article, a professor of molecular biology and genetics, and co-director of the High Throughput Biology Center of the Institute for Basic Biomedical Sciences at Johns Hopkins. "A single microarray experiment was able to reveal such a large number of new insertions that no one had ever reported before. The discovery taught us that these transposons are much more active than we had guessed."

    Each of the 15 different DNA samples used in the study was purified from blood cells before it was applied to a DNA chip. Transposons stick to spots on the DNA chip corresponding to where they're normally found in the genome, letting the researchers locate new ones.

    Boeke's group first invented the transposon chip in 2006 for use in yeast. But, it was Kathleen Burns, M.D., Ph.D., now an assistant professor of pathology at Johns Hopkins, who first got the chip to work with human DNA. "The human genome is much larger and more complex, and there are lots of look-a-like DNAs that are not actively moving but are similar to the transposons that we were interested in," says Burns. The trick was to modify how they copied the DNA before it was applied over the chip. The team was able to copy DNA from the transposons of interest, which have just three different genetic code letters than other look-alike DNA segments.

    "We've known that genomes aren't static places, but we didn't know how many transposons there are in each one of us; we didn't know how often a child is born with a new one that isn't found in either parent and we didn't know if these DNAs were moving around in diseases like cancer," says Burns. "Now we have a tool for answering these questions. This adds a whole dimension to how we look at our DNA."

    Anna Schneider, Yunqi Lu, Tejasvi Niranjan, Peilin Shen, Matoya Robinson, Jared Steranka, David Valle, Curt Civin, Tao Wang, Sarah Wheelan and Hongkai Ji from Johns Hopkins Medicine are additional authors on the manuscript.

    Funding for this research was provided by grants from the National Cancer Institute, the National Human Genome Research Institute, the Brain Science Institute at Johns Hopkins School of Medicine and the Goldhirsh Foundation and by a Career Award for Medical Scientists from the Burroughs Wellcome Foundation.

    100811085416-large.jpg
    A new scan of the human genome has shed light on why people have such a variety of physical traits and disease risks. (Credit: iStockphoto)
    zan
    转播转播0 分享淘帖0 分享分享0 收藏收藏0 支持支持0 反对反对0 微信微信
    优秀的男人最有魅力!

    1

    主题

    4

    听众

    63

    积分

    升级  61.05%

    该用户从未签到

    回复

    使用道具 举报

    0

    主题

    3

    听众

    306

    积分

    升级  2%

  • TA的每日心情
    开心
    2012-2-13 00:42
  • 签到天数: 25 天

    [LV.4]偶尔看看III

    群组2012第三期美赛培训

    回复

    使用道具 举报

    0

    主题

    3

    听众

    306

    积分

    升级  2%

  • TA的每日心情
    开心
    2012-2-13 00:42
  • 签到天数: 25 天

    [LV.4]偶尔看看III

    群组2012第三期美赛培训

    回复

    使用道具 举报

    11

    主题

    6

    听众

    2308

    积分

    升级  10.27%

  • TA的每日心情
    慵懒
    2015-6-9 22:13
  • 签到天数: 155 天

    [LV.7]常住居民III

    社区QQ达人 邮箱绑定达人 发帖功臣

    群组2012第三期美赛培训

    群组学术交流A

    群组学术交流B

    回复

    使用道具 举报

    0

    主题

    2

    听众

    92

    积分

    升级  91.58%

    该用户从未签到

    新人进步奖

    回复

    使用道具 举报

    ytz        

    0

    主题

    2

    听众

    91

    积分

    升级  90.53%

    该用户从未签到

    新人进步奖

    回复

    使用道具 举报

    0

    主题

    2

    听众

    109

    积分

    升级  4.5%

    该用户从未签到

    新人进步奖

    回复

    使用道具 举报

    lvtom        

    0

    主题

    2

    听众

    86

    积分

    升级  85.26%

    该用户从未签到

    新人进步奖

    楼主,你写得实在是太好了。我惟一能做的,就只有把这个帖子顶上去这件事了
    回复

    使用道具 举报

    ljmmjl        

    0

    主题

    2

    听众

    80

    积分

    升级  78.95%

    该用户从未签到

    新人进步奖

    回复

    使用道具 举报

    piggy0702        

    1

    主题

    2

    听众

    82

    积分

    升级  81.05%

    该用户从未签到

    新人进步奖

    回复

    使用道具 举报

    您需要登录后才可以回帖 登录 | 注册地址

    qq
    收缩
    • 电话咨询

    • 04714969085
    fastpost

    关于我们| 联系我们| 诚征英才| 对外合作| 产品服务| QQ

    手机版|Archiver| |繁體中文 手机客户端  

    蒙公网安备 15010502000194号

    Powered by Discuz! X2.5   © 2001-2013 数学建模网-数学中国 ( 蒙ICP备14002410号-3 蒙BBS备-0002号 )     论坛法律顾问:王兆丰

    GMT+8, 2025-8-16 18:45 , Processed in 0.757601 second(s), 112 queries .

    回顶部