• Title/Summary/Keyword: Combinatorial

Search Result 693, Processing Time 0.03 seconds

In Vitro Combinatorial Mutagenesis of the 65th and 222nd Positions of the Green Fluorescent Protein of Aequarea victoria

  • Nakano, Hideo;Okumura, Reiko;Goto, Chinatsu;Yamane, Tsuneo
    • Biotechnology and Bioprocess Engineering:BBE
    • /
    • v.7 no.5
    • /
    • pp.311-315
    • /
    • 2002
  • By the in vitro combinatorial mutagenesis, which is a sequential reaction of PCR mutagenesis and in vitro coupled transcription/translation with Escherichia coli S30 extract, S65 and E222 of green fluorescent protein of Aequarea victoria were comprehensively changed to all possible combinations of amino acids, thus totally 400 mutant (including a wild type) proteins were simultaneously produced and their fluorescent properties were analyzed. Although a few mutations had been reported so far at the 222nd position, replacement E222 to all other19 amino acids gave fluorescent signal to the mutants by changing Ser 65 to Ala together. Among the mutants, replacement to G, A, S, Q, H and C gave relatively high fluorescence. The in vitro combinatorial mutagenesis, therefore, has been proved valuable for comprehensive structure-function studies of proteins.

Modulation of Hydrolysis and Transglycosylation Activity of Thermus Maltogenic Amylase by Combinatorial Saturation Mutagenesis

  • Oh, Su-Won;Jang, Myoung-Uoon;Jeong, Chang-Ku;Kang, Hye-Jeong;Park, Jung-Mi;Kim, Tae-Jip
    • Journal of Microbiology and Biotechnology
    • /
    • v.18 no.8
    • /
    • pp.1401-1407
    • /
    • 2008
  • The roles of conserved amino acid residues (Va1329-Ala330-Asn331-Glu332), constituting an extra sugar-binding space (ESBS) of Thermus maltogenic amylase (ThMA), were investigated by combinatorial saturation mutagenesis. Various ThMA mutants were firstly screened on the basis of starch hydrolyzing activity and their enzymatic properties were characterized in detail. Most of the ThMA variants showed remarkable decreases in their hydrolyzing activity, but their specificity against various substrates could be altered by mutagenesis. Unexpectedly, mutant H-16 (Gly-Leu-Val-Tyr) showed almost identical hydrolyzing and transglycosylation activities to wild type, whereas K-33 (Ser-Gly-Asp-Glu) showed an extremely low transglycosylation activity. Interestingly, K-33 produced glucose, maltose, and acarviosine from acarbose, whereas ThMA hydrolyzed acarbose to only glucose and acarviosine-glucose. These results propose that the substrate specificity, hydrolysis pattern, and transglycosylation activity of ThMA can be modulated by combinatorial mutations near the ESBS.

Combinatorial Solid Phase Peptide Synthesis and Bioassays

  • Shin, Dong-Sik;Kim, Do-Hyun;Chung, Woo-Jae;Lee, Yoon-Sik
    • BMB Reports
    • /
    • v.38 no.5
    • /
    • pp.517-525
    • /
    • 2005
  • Solid phase peptide synthesis method, which was introduced by Merrifield in 1963, has spawned the concept of combinatorial chemistry. In this review, we summarize the present technologies of solid phase peptide synthesis (SPPS) that are related to combinatorial chemistry. The conventional methods of peptide library synthesis on polymer support are parallel synthesis, split and mix synthesis and reagent mixture synthesis. Combining surface chemistry with the recent technology of microelectronic semiconductor fabrication system, the peptide microarray synthesis methods on a planar solid support are developed, which leads to spatially addressable peptide library. There are two kinds of peptide microarray synthesis methodologies: pre-synthesized peptide immobilization onto a glass or membrane substrate and in situ peptide synthesis by a photolithography or the SPOT method. This review also discusses the application of peptide libraries for high-throughput bioassays, for example, peptide ligand screening for antibody or cell signaling, enzyme substrate and inhibitor screening as well as other applications.

Software Product Line Test Cases Derivation Using Combinatorial Test Design (조합 시험 설계를 이용한 소프트웨어 제품라인 시험항목 생성 방법)

  • Haeun, Baek;Sungwon, Kang;Jihyun, Lee
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.7
    • /
    • pp.469-480
    • /
    • 2014
  • Software Product Line (SPL) is a software development paradigm that guarantees high productivity, reduced cost, and shorter time-to-market by systematically planning and reusing commonality and variability. In order to maximize the benefits of SPL engineering, testing should be integrated into the SPL engineering lifecycle processes that consist of domain engineering and application engineering and should be performed with as little test efforts as possible. This paper proposes a systematic software product line test cases derivation method using combinatorial test design. By applying combinatorial test design to product line test cases derivation and exploiting commonality between products at the same time, the number of generated test cases is dramatically reduced with the result that they can be effectively reused by the products of the given product line. Case studies conducted in this paper show the efficacy of our method compared with other methods that use only commonality or combinatorial design or neither of them in terms of the number of derived test cases.

Synthesis of (Gd0.74Y0.11Tb0.15P1.15)OδPhosphors Using Combinatorial Chemistry (조합화학을 이용한 (Gd0.74Y0.11Tb0.15P1.15)Oδ 형광체 합성 및 발광특성)

  • 이재문;유정곤;박덕현;김지식;손기선
    • Journal of the Korean Ceramic Society
    • /
    • v.41 no.5
    • /
    • pp.381-387
    • /
    • 2004
  • Recently developed Plasma Display Panels (PDP) require phosphors of high luminance at Vacuum Ultraviolet (VUV) excitation. The present investigation developed new PDP phosphors using combinatorial chemistry method. We applied T $b^{3+}$ -activated yttrium gadolinium phosphates system to our combinatorial fine-tuning technique. As a result, the optimum composition was determined to be (G $d_{0.74}$ $Y_{0.11}$T $b_{0.15}$) $P_{1.15}$ $O_{\delta}$ through the two-step combinatorial screening process including excess phosphorous and Gd replacement. We found that the sample of the optimum composition shows a higher luminescence efficiency at VUV excitation and a shorter decay time than the commercially available Z $n_2$ $SiO_4$:Mn phosphor.

A Rapid Algorithm for Optimal Allocation in Combinatorial Auctions (조합 경매에서의 최적 분배를 위한 빠른 알고리즘)

  • 송진우;양성봉
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.9
    • /
    • pp.477-486
    • /
    • 2003
  • In combinatorial auctions buyers nay bid for arbitrary combinations of goods. But determining the winners of combinatorial auctions who maximize the profit of a seller is known to be NP-complete. A branch-and-bound method can be one of practical algorithm for winner determination. However, bid selection heuristics play a very important role in the efficiency of a branch-and-bound method. In this paper, we designed and implemented an algorithm which used a branch-and-bound method and Linear Programming for winner determination in combinatorial auctions. We propose new bid selection heuristics which consider a branching bid and conflicting bids simultaneously to select a branching bid in the algorithm. In addition, upper bounds are reused to reduce the running time in specific cases. We evaluated the performance of the algorithm by experiments with five data distributions and compared our method with others. The algorithm using heuristics showed a superior efficiency in two data distributions and a similar efficiency in three distributions.

Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem

  • Eddaly, Mansour;Jarboui, Bassem;Siarry, Patrick
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.4
    • /
    • pp.295-311
    • /
    • 2016
  • This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

Combinatorial Synthesis and Screening of the $Eu^{2+}$-activated Phosphors for LED in the System CaO-$Al_2O_3-SiO_2$

  • Park, Seung-Hyok;Yoon, Ho-Shin;Kim, Chang-Hae;Jang, Ho-Gyeom
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.647-649
    • /
    • 2004
  • We have synthesized phosphor in the system CaO-$Al_2O_3-SiO_2$ by combinatorial polymerized-complex method. The application of combinatorial synthesis and characterization of luminescent materials has been enlarged to identification and optimization in interesting new phosphor. In this study, we investigated luminescent properties of above-mentioned materials by excitation and emission spectra. In $Eu^{2+}$ activated $Ca_1Al_2Si_2O_8$ phosphor emit the blue light.

  • PDF

A Characterization of Isomorphism Problem of Combinatorial objects and the Historical Note (조합대상의 동형사상 문제의 특성화와 역사적 고찰)

  • Park, Hong-Goo
    • Journal for History of Mathematics
    • /
    • v.19 no.1
    • /
    • pp.33-42
    • /
    • 2006
  • In this paper, we study the theoretical and historical backgrounds with respect to isomorphism problem of combinatorial objects which is one of major problems in the theory of Combinatorics. And also, we introduce a partial result for isomorphism problem of Cayley objects over a finite field.

  • PDF

Antibradykinin Effects of the Non-peptide Antagonists of Mixture Libraries Prepared by Solution-phase Combinatorial Synthesis

  • KAM Yoo Lim;CHOO Hea-Young P.
    • Biomolecules & Therapeutics
    • /
    • v.13 no.3
    • /
    • pp.181-184
    • /
    • 2005
  • The solution-phase combinatorial synthesis of iminodiacetic acid triamide libraries linked to 1-(4-chlorobenzhydryl)piperazine has been reported. Ten mixture libraries, each containing 5 components, were synthesized in 4 steps from N-BOC-iminodiacetic acid anhydride. Antibradykinin effects of the mixture and individual libraries were compared using guinea-pig ileum smooth muscle. The changes in the inhibition were also observed by testing the combination of two different compounds from the same library. We found out the correlation between the inhibition of mixtures and that of individual libraries. It is possible to choose the mixtures with relatively high inhibitory effects to find out the most effective individual compound for further synthesis.