检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:金京波[1] 王台[1] 程佑发[1] 王雷[1] 张景昱[1] 景海春[1] 种康[1] JIN Jingbo;WANG Tai;CHENG Youfa;WANG Lei;ZHANG Jingyu;JING Haichun;CHONG Kang(Institute of Botany,Chinese Academy of Sciences,Beijing 100093,China)
出 处:《中国科学院院刊》2021年第6期660-665,共6页Bulletin of Chinese Academy of Sciences
基 金:中国科学院战略性先导科技专项(A类)(XDA26030000)。
摘 要:高产优质牧草品种是保证我国草牧业可持续发展的关键。但我国牧草育种起步晚,工作进程十分缓慢,严重缺乏具有自主知识产权的牧草品种。由于牧草一般具有自交不亲和、异花授粉、多倍体遗传、近交退化等特性,很难解析其重要农艺性状,导致牧草育种技术还停留在杂交选育为主的“2.0时代”。分子设计育种是加快牧草新品种选育的好手段,但目前尚缺乏适用于牧草分子设计的理论和技术体系。为抢占牧草分子育种先机,中国科学院布局了战略性先导科技专项(A类)“创建生态草牧业科技体系”,以攻克“牧草复杂基因组功能解析”这一“卡脖子”技术,发展基于分子设计理念的牧草育种新技术,实现从传统育种到定向分子育种的跨越,培育具有自主知识产权的高产优质牧草品种。High-yield and high-quality forage varieties are the key to sustainable development of grass-based livestock husbandry in China.However,the forage breeding was started late in China,and the progress is very slow,and the forage varieties of independent intellectual property rights are seriously lacked.Forages generally have self-incompatibility,natural allogamy,polysomic inheritance,and marked inbreeding effects.Subsequently,it is difficult to characterize agronomically important complex traits,resulting that the breeding technology is still in the 2.0 era of hybrid breeding.The molecular design-based breeding is a fine strategy to speed up the breeding process,however,there is a lack of theoretical and technical system for the molecular design-based forage breeding.Recently,the Chinese Academy of Sciences has launched the strategic priority program“Establishing Scientific and Technological System of Ecological Grass and Animal Husbandry”,to dissect complex forage genomes,establish a new molecular design-based forage breeding technologies,and breed high-yield and high-quality forage varieties with independent intellectual property rights.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38