Exploiting novel endogenous glyphosate-tolerant alleles is highly desirable and has promising potential for weed control in rice breeding. Here,through fusions of different effective cytosine and adenine deaminases wi...Exploiting novel endogenous glyphosate-tolerant alleles is highly desirable and has promising potential for weed control in rice breeding. Here,through fusions of different effective cytosine and adenine deaminases with nCas9-NG, we engineered an effective surrogate two-component composite base editing system, STCBE-2, with improved C-to-T and A-to-G base editing efficiency and expanded the editing window. Furthermore,we targeted a rice endogenous OsEPSPS gene for artificial evolution through STCBE-2-mediated near-saturated mutagenesis. After hygromycin and glyphosate selection, we identified a novel OsEPSPS allele with an Asp-213-Asn(D213N)mutation(OsEPSPS-D213N) in the predicted glyphosate-binding domain, which conferred rice plants reliable glyphosate tolerance and had not been reported or applied in rice breeding. Collectively, we developed a novel dual base editor which will be valuable for artificial evolution of important genes in crops. And the novel glyphosate-tolerant rice germplasm generated in this study will benefit weeds management in rice paddy fields.展开更多
Scheduling with group technology has been a vivid research area in the past decades.However,group technology with general dual-effect variable processing times needs to be further explored although this kind of group...Scheduling with group technology has been a vivid research area in the past decades.However,group technology with general dual-effect variable processing times needs to be further explored although this kind of group technology plays an important role in some actual manufacturing scenarios.Accordingly,this paper considers group scheduling problems with a kind of general group variable processing times model,where the actual processing time of each job in group is variable due to the dual effect of both the job position and the group position.The objectives of two types of considered problems are to minimize the makespan and the total completion time,respectively.Based on the decomposition analysis,the mathematical logic analysis and the computational complexity proof,it is obtained that the makespan minimization problem and the total completion time minimization problem are both polynomially solvable under the condition that the group number is constant.For three special cases of considered problems,polynomial solving algorithms with lower computational complexity are proposed.展开更多
基金partly funded by the National Natural Science Foundation of China (32188102 to LX)Hainan Yazhou Bay Seed Lab (B21HJ0215 to LX)+2 种基金the Central Public-Interest Scientific Institution-Based Research Fund (S2023ZD03 to LX)Key Laboratory of Gene Editing Technologies (Hainan), ChinaNational Engineering Research Center of Crop Molecular Breeding。
文摘Exploiting novel endogenous glyphosate-tolerant alleles is highly desirable and has promising potential for weed control in rice breeding. Here,through fusions of different effective cytosine and adenine deaminases with nCas9-NG, we engineered an effective surrogate two-component composite base editing system, STCBE-2, with improved C-to-T and A-to-G base editing efficiency and expanded the editing window. Furthermore,we targeted a rice endogenous OsEPSPS gene for artificial evolution through STCBE-2-mediated near-saturated mutagenesis. After hygromycin and glyphosate selection, we identified a novel OsEPSPS allele with an Asp-213-Asn(D213N)mutation(OsEPSPS-D213N) in the predicted glyphosate-binding domain, which conferred rice plants reliable glyphosate tolerance and had not been reported or applied in rice breeding. Collectively, we developed a novel dual base editor which will be valuable for artificial evolution of important genes in crops. And the novel glyphosate-tolerant rice germplasm generated in this study will benefit weeds management in rice paddy fields.
基金the National Natural Science Foundation of China(No.71573121)China Postdoctoral Science Foundation Funded Project(No.2016M590453)the Fundamental Research Funds for the Central Universities(Nos.NS2016080 and NR2016005).
文摘Scheduling with group technology has been a vivid research area in the past decades.However,group technology with general dual-effect variable processing times needs to be further explored although this kind of group technology plays an important role in some actual manufacturing scenarios.Accordingly,this paper considers group scheduling problems with a kind of general group variable processing times model,where the actual processing time of each job in group is variable due to the dual effect of both the job position and the group position.The objectives of two types of considered problems are to minimize the makespan and the total completion time,respectively.Based on the decomposition analysis,the mathematical logic analysis and the computational complexity proof,it is obtained that the makespan minimization problem and the total completion time minimization problem are both polynomially solvable under the condition that the group number is constant.For three special cases of considered problems,polynomial solving algorithms with lower computational complexity are proposed.
