• 제목/요약/키워드: pal

검색결과 1,097건 처리시간 0.031초

Molecular Characterization of Extracellular Medium-chain-length Poly(3-hydroxyalkanoate) Depolymerase Genes from Pseudomonas alcaligenes Strains

  • Kim Do Young;Kim Hyun Chul;Kim Sun Young;Rhee Young Ha
    • Journal of Microbiology
    • /
    • 제43권3호
    • /
    • pp.285-294
    • /
    • 2005
  • A bacterial strain M4-7 capable of degrading various polyesters, such as poly$(\varepsilon-caprolactone)$, poly(3-hydroxybutyrate-co-3-hydroxyvalerate), poly(3-hydroxyoctanoate), and poly(3-hydroxy-5-phenylvalerate), was isolated from a marine environment and identified as Pseudomonas alcaligenes. The relative molecular mass of a purified extracellular medium-chain-length poly(3-hydroxyalkanoate) (MCL-PHA) depolymerase $(PhaZ_{palM4-7})$ from P. alcaligenes M4-7 was 28.0 kDa, as determined by SDS-PAGE. The $PhaZ_{palM4-7}$ was most active in 50 mM glycine-NaOH buffer (pH 9.0) at $35^{\circ}C$. It was insensitive to dithiothreitol, sodium azide, and iodoacetamide, but susceptible to p-hydroxymercuribenzoic acid, N-bromosuccinimide, acetic anhydride, EDTA, diisopropyl fluorophosphate, phenylmethylsulfonyl fluoride, Tween 80, and Triton X-100. In this study, the genes encoding MCL-PHA depolymerase were cloned, sequenced, and characterized from a soil bacterium, P. alcaligenes LB19 (Kim et al., 2002, Biomacro-molecules 3, 291-296) as well as P. alcaligenes M4-7. The structural gene $(phaZ_{palLB19})$ of MCL-PHA depolymerase of P. alcaligenes LB19 consisted of an 837 bp open reading frame (ORF) encoding a protein of 278 amino acids with a deduced $M_r$ of 30,188 Da. However, the MCL-PHA depolymerase gene $(phaZ_{palM4-7})$ of P. alcaligenes M4-7 was composed of an 834 bp ORF encoding a protein of 277 amino acids with a deduced Mr of 30,323 Da. Amino acid sequence analyses showed that, in the two different polypeptides, a substrate-binding domain and a catalytic domain are located in the N-terminus and in the C-terminus, respectively. The $PhaZ_{palLB19}$ and the $PhaZ_{palM4-7}$ commonly share the lipase box, GISSG, in their catalytic domains, and utilize $^{111}Asn$ and $^{110}Ser$ residues, respectively, as oxyanions that play an important role in transition-state stabilization of hydrolytic reactions.

팔당호 유량변동에 따른 수질특성에 관한 연구 (A study on the Character of Water Quality according to the Flux in Pal-Dang Reservoir)

  • 김종민
    • 환경위생공학
    • /
    • 제10권1호
    • /
    • pp.12-24
    • /
    • 1995
  • I tried to evaluate the reason of the monthly variation of water quality according to the hydrologic character of Pal- dang reservoir inflow variation. The result of this study is as below; 1 ) COD, BOD, Total- nitrogen and Total- phosphate concentration increase generally according to the flux and Total- phosphate concentration is the most affected item by flux. 2) COD, BOD, Total- nitrogen and Total- phosphate concentration increase according the flux, but they begin to decrease at the below point ; COD · 1,154 CMS, BOD : 1,007 (CMS cubicmeter per second ) and Inflow- Concentration interrelation formula is as below; table omitted.

  • PDF

THE OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE ALL HINGE VERTICES ON INTERVAL GRAPHS

  • Bera, Debashis;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • 제8권2호
    • /
    • pp.387-401
    • /
    • 2001
  • If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

AN OPTIMAL ALGORITHM FOR FINDING DETH-FIRST SPANNING TREE ON PERMUTATION GRAPHS

  • Mondal, Sukumar;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • 제6권3호
    • /
    • pp.727-734
    • /
    • 1999
  • Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS

  • SAHA ANITA;PAL MADHUMANGAL;PAL TAPAN K.
    • Journal of applied mathematics & informatics
    • /
    • 제19권1_2호
    • /
    • pp.77-92
    • /
    • 2005
  • An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

유럽향 2세대 Wide TV용 PALplus 디지털 디코더 시스템의 개발 (Development of PALplus Digital Decoder System for the European 2nd Generation Wide TV)

  • 김정훈;이민승;정태홍;송동일;이명호
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 1997년도 학술대회
    • /
    • pp.101-106
    • /
    • 1997
  • Palplus system is a new European 16:9 wide screen TV format which has a full compatibility with standard PAL and the system has a advantage of improving picture quality by the reduction of cross color and cross luminance as well as making use of the full horizontal luminance bandwidth of the PAL system. We implemented European 16:9 PALplus Digital decoder(625/50/2:1) system using SVP(Serial Video Processor) IC and discrete helper demodulator.

  • PDF