从常规粳稻常优94后代中筛选到一份自然突变的抽穗期延迟的类树稻突变体lhd3(leafy head 3)。在短日照条件下,与野生型比较,lhd3突变体在生长后期,上部节间会继续长出叶片(一般为3片)和高位分蘖,类似于树的侧枝生长,抽穗期延迟,但基部...从常规粳稻常优94后代中筛选到一份自然突变的抽穗期延迟的类树稻突变体lhd3(leafy head 3)。在短日照条件下,与野生型比较,lhd3突变体在生长后期,上部节间会继续长出叶片(一般为3片)和高位分蘖,类似于树的侧枝生长,抽穗期延迟,但基部分蘖数不受影响。经典遗传分析表明,lhd3与籼稻南京6号的F2群体中,正常植株与类树稻植株的分离比符合3∶1,说明此性状受单隐性基因控制。利用该群体进行图位克隆,将LHD3基因定位在水稻第1染色体短臂的两个新发展的STS标记wpla3和wpla25之间。再利用5个新发展的STS和CAPS标记,最终将该基因精细定位在WX6和CAPS1两个标记之间,物理距离约为60 kb。通过水稻基因组注释系统共预测到10个开放阅读框(ORF)。对该基因的进一步克隆将有助于阐明水稻生育期和叶原基发育调控机理。展开更多
This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,proce...This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.展开更多
文摘从常规粳稻常优94后代中筛选到一份自然突变的抽穗期延迟的类树稻突变体lhd3(leafy head 3)。在短日照条件下,与野生型比较,lhd3突变体在生长后期,上部节间会继续长出叶片(一般为3片)和高位分蘖,类似于树的侧枝生长,抽穗期延迟,但基部分蘖数不受影响。经典遗传分析表明,lhd3与籼稻南京6号的F2群体中,正常植株与类树稻植株的分离比符合3∶1,说明此性状受单隐性基因控制。利用该群体进行图位克隆,将LHD3基因定位在水稻第1染色体短臂的两个新发展的STS标记wpla3和wpla25之间。再利用5个新发展的STS和CAPS标记,最终将该基因精细定位在WX6和CAPS1两个标记之间,物理距离约为60 kb。通过水稻基因组注释系统共预测到10个开放阅读框(ORF)。对该基因的进一步克隆将有助于阐明水稻生育期和叶原基发育调控机理。
基金supported by the National Natural Science Foundation of China (7087103290924021+2 种基金70971035)the National High Technology Research and Development Program of China (863 Program) (2008AA042901)Anhui Provincial Natural Science Foundation (11040606Q27)
文摘This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.
