• Title/Summary/Keyword: parent vector

Search Result 18, Processing Time 0.021 seconds

Development of a Recombinant Streptomyces griseus with sprA and sprB Genes for Proteolytic Enzyme Production (Streptomyces griseus IFO13350 유래 sprA 및 sprB 유전자를 이용한 Pretense 생산균주 개발)

  • Hwang Ji-Hwan;Lee Chang-Kwon;Lee Kang-Mu;Jo Byoung-Kee;Park Hae-Ryong;Hwang Yong-Il
    • Korean Journal of Microbiology
    • /
    • v.41 no.1
    • /
    • pp.87-92
    • /
    • 2005
  • Pronase, a protease produced for commercial purpose by Streptomyces griseus, was composed of serine protease, alkaline protease, aminopeptidase and carboxypeptidase complex, and it has been widely used as anti-inflammatory drugs for human therapy. In this study, we developed a new integration vector, pHJ101 derived from pSET152, containing strong promoter, ermE, to overexpress a certain protease gene. Specific PCR primers for cloning of sprA (a gene for S. griseus protease A) and sprB (a gene for S. griseus protease B) genes were designed from the basis of nucleotide sequence in databases and amplified by PCR. Plasmid pHJ201 and pHJ202 were constructed by inserting of amplified each gene in a vector pHJ101. S. griseus HA and S. griseus HB were respectively obtained by conjugal process of a parent strain, S. griseus IFO 13350 with the recombinant Escherichia coli harboring plasmid pHJ201 or pHJ202. When protease activity was measured in flask cultivation, produced protease levels of S. griseus HA and S. griseus HB increased about 5.3 times and 5 times, respectively, more than that of parent strain. And, the constructed integrating plasmid pHJ101 was applicable for overexpression of a certain gene in Streptomyces sp.

Multi-Dimensional Vector Approximation Tree with Dynamic Bit Allocation (동적 비트 할당을 통한 다차원 벡터 근사 트리)

  • 복경수;허정필;유재수
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.3
    • /
    • pp.81-90
    • /
    • 2004
  • Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

  • PDF

An algorithm for Video Object Detection using Multiresolution Motion Estimation (다해상도 움직임 예측을 이용한 동영상 물체탐지 알고리즘)

  • 조철훈;박장한;이한우;남궁재찬
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.1
    • /
    • pp.87-95
    • /
    • 2003
  • This paper proposes an object detection algorithm using the Multiresolution Motion Estimation(MRME) in wavelet d야main. A existing motion estimation method has characteristics of motion estimation but it requires having computation. Motion estimation in higher resolution used the motion vector of the lower resolution with the MRME that has parent-child relationship on wavelet coefficients. This method reduces the search area of motion estimation in higher resolution and computational complexity. The computational complexity of the proposed method is about 40% of the existing method using 3-level Set Partitioning in Hierarchical Trees(SPIHT) wavelet transform. The experimental results with the proposed method showed about 11% decrease of Mean Absolute Difference(MAD) and gains able to precise tracking of object.

Construction of a High-efficiency Shuttle Vector Containing the Minimal Replication Origin of Bacillus thuringiensis

  • Kang Joong Nam;Kim Yang-Su;Wang Yong;Choi Heekyu;Li Ming Shun;Shin Sang Chul;Jin Byung Rae;Roh Jong Yul;Choi Jae Young;Je Yeon Ho
    • International Journal of Industrial Entomology and Biomaterials
    • /
    • v.11 no.2
    • /
    • pp.125-127
    • /
    • 2005
  • In order to improve the transformation efficiency of the Bacillus thuringiensis (Bt)-Escherichia coli (E. coli) shuttle vector, pHT3101, we intended to minimize replication origin of Bt in pHT3101. For this, two modified shuttle vectors, pHT1K and pHT261, in which 2.9 kb of replication origin of Bt were shortened to 1 kb and 261 bp, respectively as previously reported. Whereas the pHT1K could efficiently transform Bt into the antibiotic resistant, no transformants were obtained with pHT261. Furthermore, pHT1K showed higher transformation efficiency compared to that of parent vector, pHT3101. Therefore, pHT1K might be a very useful Bt-E. coli shuttle vector carrying minimal replication origin of Bt.

An Efficient Routing Scheme based on Link Quality and Load Balancing for Wireless Sensor Networks (무선 센서 네트워크에서 링크 상태 및 트래픽 분산 정보를 이용한 효과적인 라우팅 방법)

  • Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.11-19
    • /
    • 2010
  • ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

A yeast Chromosomal Gene that Induces Defective Interfering Particles of L-A dsRNA Virus in $ski^-$ Host Cells ($ski^-$ 기주 세포에서 L-A dsRNA 바이러스의 defective interfering particle을 유도하는 효모 유전자)

  • 이현숙
    • Korean Journal of Microbiology
    • /
    • v.29 no.2
    • /
    • pp.75-79
    • /
    • 1991
  • The yeast L-A virus (4.6 kb dsRNA genome) encodes the major coat protein and a "gag-pol" fusion minor coat protein that separately encapsidate itself and $M_{1}$, a 1.8 kb dsRNA satellite virus encoding a secreted protein toxin (the killer toxin). The teast chromosomal SKI genes prevent viral cytopathology by lowering the virus copy number. Thus, $ski^{-}$ mutants are ts and cs for growth. We transformed a ski2-2 virus-infested mutant with a yeast bank in a high copy cloning vector and selected the rare healthy transformants for analysis. One type of transformant segregated M-O L-A-O cells with high frequency. Elimination of the DNA clone from the ski2-2 strain eliminated this phinotype and introduction of the DNA clone recovered from such transformants into the parent ski2-2 strain, or into ski3 or ski6 mutants gave the same phenotype. This killer-curing phenotype was due to the curing of the helper L-A dsRNA virus. The 6.5 kb insert only had this activity when carried on a high copy vector and in $ski^{-}$ cells (not in $SKI^{+}$ cells). This 6.5 kb insert acts as a mutagen on L-A dsRNA producing a high rate of deletion mutations.mutations.

  • PDF

XML Dynamic Labeling Scheme Based On Vector Representation (벡터 표현을 기반으로 한 XML 동적 레이블링 기법)

  • Hong, Seok Hee
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.1
    • /
    • pp.14-23
    • /
    • 2014
  • There have been many researches for XML as the international standard to store and exchange data on the internet. Among these research fields, we focus on the techniques labeling the nodes of the XML tree that is required for querying the structural information. A labeling scheme assigns the unique label to the nodes and supports the queries for the structural information such as Ancestor-Descendant and Parent-Child relationships. In this paper, we propose a labeling scheme using vector representation where the assigned labels are not altered although XML documents are changed dynamically. Our labeling scheme reduces the storage requirement for the labels of the XML tree and provides the efficient query by using the fixed-length labels with a short size. Result of performance evaluation shows that our labeling scheme is superior to the previous approaches.

On the Heterogeneous Postal Delivery Model for Multicasting

  • Sekharan, Chandra N.;Banik, Shankar M.;Radhakrishnan, Sridhar
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.536-543
    • /
    • 2011
  • The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.

Construction of a Shuttle Vector for Protein Secretory Expression in Bacillus subtilis and the Application of the Mannanase Functional Heterologous Expression

  • Guo, Su;Tang, Jia-Jie;Wei, Dong-Zhi;Wei, Wei
    • Journal of Microbiology and Biotechnology
    • /
    • v.24 no.4
    • /
    • pp.431-439
    • /
    • 2014
  • We report the construction of two Bacillus subtilis expression vectors, pBNS1/pBNS2. Both vectors are based on the strong promoter P43 and the ampicillin resistance gene expression cassette. Additionally, a fragment with the Shine-Dalgarno sequence and a multiple cloning site (BamHI, SalI, SacI, XhoI, PstI, SphI) were inserted. The coding region for the amyQ (encoding an amylase) signal peptide was fused to the promoter P43 of pBNS1 to construct the secreted expression vector pBNS2. The applicability of vectors was tested by first generating the expression vectors pBNS1-GFP/pBNS2-GFP and then detecting for green fluorescent protein gene expression. Next, the mannanase gene from B. pumilus Nsic-2 was fused to vector pBNS2 and we measured the mannanase activity in the supernatant. The mannanase total enzyme activity was 8.65 U/ml, which was 6 times higher than that of the parent strain. Our work provides a feasible way to achieve an effective transformation system for gene expression in B. subtilis and is the first report to achieve B. pumilus mannanase secretory expression in B. subtilis.

Multi-Object Detection and Tracking Using Dual-Layer Particle Sampling (이중계층구조 파티클 샘플링을 사용한 다중객체 검출 및 추적)

  • Jeong, Kyungwon;Kim, Nahyun;Lee, Seoungwon;Paik, Joonki
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.9
    • /
    • pp.139-147
    • /
    • 2014
  • In this paper, we present a novel method for simultaneous detection and tracking of multiple objects using dual-layer particle filtering. The proposed dual-layer particle sampling (DLPS) algorithm consists of parent-particles (PP) in the first layer for detecting multiple objects and child-particles (CP) in the second layer for tracking objects. In the first layer, PPs detect persons using a classifier trained by the intersection kernel support vector machine (IKSVM) at each particle under a randomly selected scale. If a certain PP detects a person, it generates CPs, and makes an object model in the detected object region for tracking the detected object. While PPs that have detected objects generate CPs for tracking, the rest of PPs still move for detecting objects. Experimental results show that the proposed method can automatically detect and track multiple objects, and efficiently reduce the processing time using the sampled particles based on motion distribution in video sequences.