Chọn tạo các dòng ngô được chuyển gen kháng sâu (CryIAc) thông qua vi khuẩn Agrobacterium tumefaciens

Maize, together with wheat and water rice, is one of the most important cereals of the world. Gene transformation via grobacteria tumefaciens has been popular among developing countries like Viet Nam for being cost – saving and easily appilicable on various kinds of plants. 1. Insect resistant gene (CryIAc) has been transferred successfully into HR9 imported maize lines. 2. The research has initially assessed the expression of the transgenic gene by PCR method and assessment method for transgenic plants grown in insect isolated grid house. Findings and results of thesis are of scientific value and practically significant for developing transgenic corn trees in Viet Nam in future.

Title: Chọn tạo các dòng ngô được chuyển gen kháng sâu (CryIAc) thông qua vi khuẩn Agrobacterium tumefaciens
Authors: Trương, Thu Hằng
Issue Date: 2013
Publisher: H. : ĐHQGHN
Citation: 13 tr.
Abstract: Maize, together with wheat and water rice, is one of the most important cereals of the world. Gene transformation via grobacteria tumefaciens has been popular among developing countries like Viet Nam for being cost – saving and easily appilicable on various kinds of plants. 1. Insect resistant gene (CryIAc) has been transferred successfully into HR9 imported maize lines. 2. The research has initially assessed the expression of the transgenic gene by PCR method and assessment method for transgenic plants grown in insect isolated grid house. Findings and results of thesis are of scientific value and practically significant for developing transgenic corn trees in Viet Nam in future.
URI: http://repository.vnu.edu.vn/handle/11126/13016
Appears in Collections:Natural Sciences and Technology

Nhận xét

Đăng nhận xét

Bài đăng phổ biến từ blog này

Một số định lý duy nhất trong lý thuyết Nevanlina : Luận văn ThS. Toán học: 60 46 01

Title:  Một số định lý duy nhất trong lý thuyết Nevanlina : Luận văn ThS. Toán học: 60 46 01 Authors:  Nguyễn, Đình Sang, người hướng dẫn Dương, Thanh Mi Keywords:  Toán học Giải tích Định lý duy nhất Lý thuyết Nevanlina Issue Date:  2012 Publisher:  ĐHKHTN Abstract:  36 tr. + CD-ROM Luận văn ThS. Giải tích -- Trường Đại học Khoa học Tự nhiên. Đại học Quốc gia Hà Nội, 2012 Trình bày một số kiến thức cơ bản của giải tích phức. Các khái niệm cơ bản như khái niệm hàm chỉnh hình, sự hội tụ điểm, sự hội tụ đều,… Giới thiệu các kết quả cổ điểm của Montel, Ascoli-Arzela, Runge, Stone-Weierstrass,… về tính chỉnh hình của hàm giới hạ (...) Electronic Resources URI:  http://repository.vnu.edu.vn/handle/VNU_123/37891 Appears in Collections: HUS - Master Theses
Đọc thêm

Demonstrating LISP-based virtual machine mobility for Cloud networks

Hình ảnh
Nowadays, the rapid growth of Cloud computing services is starting to overload the network communication infrastructures. This evolution reveals missing blocks of the current Internet Protocol architecture, in particular in terms of addressing and locator-identifier mapping control-plane. In this paper, we give a short overview of a solution that handles virtual-machines migration over the Internet based on the Locator/Identifier Separation Protocol, object of a technical demonstration. Title:  Demonstrating LISP-based virtual machine mobility for Cloud networks Authors:  Raad, Patrick Colombo, Giulio Phung, Chi Dung Secci, Stefano Cianfrani, Antonio Gallard, Pascal Pujolle, Guy (...), Keywords:  Cloud computing services Cloud networks Internet based Virtual machines Internet protocols Network communications Issue Date:  2012 Publisher:  H. : ĐHQGHN Abstract:  Nowadays, the rapid growth of Cloud computing services is starting to overload the network communicatio
Đọc thêm

Mining erasable itemsets with subset and superset itemset constraints

Erasable itemset (El) mining, a branch of pattern mining, helps managers to establish new plans for the development of new products. Although the problem of mining Els was first proposed in 2009, many efficient algorithms for mining these have since been developed. However, these algorithms usually require a lot of time and memory usage. In reality, users only need a small number of Els which satisfy a particular condition. Having this observation in mind, in this study we develop an efficient algorithm for mining Els with subset and superset itemset constraints (C-0 subset of X subset of C-1). Firstly, based on the MEI (Mining Erasable Itemsets) algorithm, we present the MEIC (Mining Erasable Itemsets with subset and superset itemset Constraints) algorithm in which each El is checked with regard to the constraints before being added to the results. Next, two propositions supporting quick pruning of nodes that do not satisfy the constraints are established. Based on thes
Đọc thêm