• Title/Summary/Keyword: sfs 유전자

Search Result 4, Processing Time 0.019 seconds

Regulation of sfs1 gene expression by the cAMP-cAMP receptor protein (sfs1 유전자의 cAMP-cAMP receptor protein에 의한 발현 조절)

  • Yoo, Ju-Soon;Lee, Seung-Jin;Lee, Hee-Young;Chung, Soo-Yeol;Choi, Yong-Lark
    • Applied Biological Chemistry
    • /
    • v.39 no.3
    • /
    • pp.195-199
    • /
    • 1996
  • We have cloned several E. coli sfs genes which stimulate mal gene expression with $crp^{{\ast}1}$). One the genes (pPVC2) was sequenced and potential CRP binding site is located in the upstream of the putative promoter in the regulatory region. In order to investigate the regulation of the sfs1 gene by the cAMP-CRP complex, we have constructed the sfs-lacZ fusion gene in this research. The overall transcriptional stimulations of sfs1 gene in the presence cAMP were confirmed by ${\beta}-galactosidase$ activity and Western blot analysis of sfs1-lacZ fusion gene. Transcriptional regulation by cAMP-CRP was also confirmed by Northern blot analysis. End-labelled DNA of the DNA fragment in sfs1 regulation region were used for gel retardation assay to examine the CRP-DNA complex in the presence of cAMP. Results here indicate that CRP binding site in the regulatory region of sfs1 gene is positive regulator for the expression of sfs1 gene.

  • PDF

Nucleotide Sequence and Cloning of sfs4, One of the Genes Involved in the CRP-Dependent Expression of E. coli mal Genes. (CRP 의존성 maltose 대사 촉진 유전자 sfs4의 클로닝 및 염기배열 결정)

  • Chung, Soo-Yeol;Cho, Moo-Je;Jeong, Hee-Tae;Choi, Yong-Lark
    • Applied Biological Chemistry
    • /
    • v.38 no.2
    • /
    • pp.111-117
    • /
    • 1995
  • In Escherichia coli, CRP forms a complex with cAMP and acts as a transcriptional regulator of many genes, including sugar metabolism operons. The E. coli MK2001, which is introduced the altered crp, is functional in the expression of lac, ara and man, in the absence of cAMP. However, the expression of mal gene is fully activated by the addition of cAMP or cGMP. The object of the study is cloning of the sfs (sugar fermentation stimulation) genes, which was involved in regulation of mal gene expression with the altered crp gene, and structural analysis and characterization of the genes at the molecular level. We have cloned 5 different E. coli genes which stimulate the maltose metabolism in a crp, cya::km (MK2001) background. Newly identified genes were designated as sfs. One of the sfs genes (pPC1), located at the 53.2 min map position on the E. coli chromosome, was further analyzed. Expression of the genes, which is involved in maltose metabolism, malQ (amylomaltase), was increased to 5.8-fold in the presence of a plasmid, pAP5, containing the subcloned sfs4 gene. The nucleotide seguence of a common 2,126 bp segment of the pPCM1 was determined and two open reading frames (ORF1 and ORF2) were detected. The ORF1 encodes the sfs4 gene and ORF2 encodes a truncated protein. Potential CRP binding site is located in the upstream of the putative promoter in the regulatory region. Expression of the cloned sfs4 gene was positively regulated by the cAMP-CRP complex.

  • PDF

Genetic Algorithm Based Feature Selection Method Development for Pattern Recognition (패턴 인식문제를 위한 유전자 알고리즘 기반 특징 선택 방법 개발)

  • Park Chang-Hyun;Kim Ho-Duck;Yang Hyun-Chang;Sim Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.466-471
    • /
    • 2006
  • IAn important problem of pattern recognition is to extract or select feature set, which is included in the pre-processing stage. In order to extract feature set, Principal component analysis has been usually used and SFS(Sequential Forward Selection) and SBS(Sequential Backward Selection) have been used as a feature selection method. This paper applies genetic algorithm which is a popular method for nonlinear optimization problem to the feature selection problem. So, we call it Genetic Algorithm Feature Selection(GAFS) and this algorithm is compared to other methods in the performance aspect.

Self-optimizing feature selection algorithm for enhancing campaign effectiveness (캠페인 효과 제고를 위한 자기 최적화 변수 선택 알고리즘)

  • Seo, Jeoung-soo;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.4
    • /
    • pp.173-198
    • /
    • 2020
  • For a long time, many studies have been conducted on predicting the success of campaigns for customers in academia, and prediction models applying various techniques are still being studied. Recently, as campaign channels have been expanded in various ways due to the rapid revitalization of online, various types of campaigns are being carried out by companies at a level that cannot be compared to the past. However, customers tend to perceive it as spam as the fatigue of campaigns due to duplicate exposure increases. Also, from a corporate standpoint, there is a problem that the effectiveness of the campaign itself is decreasing, such as increasing the cost of investing in the campaign, which leads to the low actual campaign success rate. Accordingly, various studies are ongoing to improve the effectiveness of the campaign in practice. This campaign system has the ultimate purpose to increase the success rate of various campaigns by collecting and analyzing various data related to customers and using them for campaigns. In particular, recent attempts to make various predictions related to the response of campaigns using machine learning have been made. It is very important to select appropriate features due to the various features of campaign data. If all of the input data are used in the process of classifying a large amount of data, it takes a lot of learning time as the classification class expands, so the minimum input data set must be extracted and used from the entire data. In addition, when a trained model is generated by using too many features, prediction accuracy may be degraded due to overfitting or correlation between features. Therefore, in order to improve accuracy, a feature selection technique that removes features close to noise should be applied, and feature selection is a necessary process in order to analyze a high-dimensional data set. Among the greedy algorithms, SFS (Sequential Forward Selection), SBS (Sequential Backward Selection), SFFS (Sequential Floating Forward Selection), etc. are widely used as traditional feature selection techniques. It is also true that if there are many risks and many features, there is a limitation in that the performance for classification prediction is poor and it takes a lot of learning time. Therefore, in this study, we propose an improved feature selection algorithm to enhance the effectiveness of the existing campaign. The purpose of this study is to improve the existing SFFS sequential method in the process of searching for feature subsets that are the basis for improving machine learning model performance using statistical characteristics of the data to be processed in the campaign system. Through this, features that have a lot of influence on performance are first derived, features that have a negative effect are removed, and then the sequential method is applied to increase the efficiency for search performance and to apply an improved algorithm to enable generalized prediction. Through this, it was confirmed that the proposed model showed better search and prediction performance than the traditional greed algorithm. Compared with the original data set, greed algorithm, genetic algorithm (GA), and recursive feature elimination (RFE), the campaign success prediction was higher. In addition, when performing campaign success prediction, the improved feature selection algorithm was found to be helpful in analyzing and interpreting the prediction results by providing the importance of the derived features. This is important features such as age, customer rating, and sales, which were previously known statistically. Unlike the previous campaign planners, features such as the combined product name, average 3-month data consumption rate, and the last 3-month wireless data usage were unexpectedly selected as important features for the campaign response, which they rarely used to select campaign targets. It was confirmed that base attributes can also be very important features depending on the type of campaign. Through this, it is possible to analyze and understand the important characteristics of each campaign type.