• Journal of Microbiology
• /
• v.44 no.1
• /
• pp.54-63
• /
• 2006

Ferritin is a major eukaryotic protein and in humans is the protein of iron storage. A partial gene fragment of ferritin (255 bp) taken from the total RNA of Periserrula leucophryna, was amplified by RT-PCR using oligonucleotide primers designed from the conserved metal binding domain of eukaryotic ferritin and confirmed by DNA sequencing. Using the $^{32}P-labeled$ partial ferritin cDNA fragment, 28 different clones were obtained by the screening of the P. leucophryna cDNA library prepared in the Uni-ZAP XR vector, sequenced and characterized. The longest clone was named the PLF (Periserrula leucophryna ferritin) gene and the nucleotide and amino acid sequences of this novel gene were deposited in the GenBank databases with accession numbers DQ207752 and ABA55730, respectively. The entire cDNA of PLF clone was 1109 bp (CDS: 129-653), including a coding nucleotide sequence of 525 bp, a 5' -untranslated region of 128 bp, and a 3'-noncoding region of 456 bp. The 5'-UTR contains a putative iron responsive element (IRE) sequence. Ferritin has an open reading frame encoding a polypeptide of 174 amino acids including a hydrophobic signal peptide of 17 amino acids. The predicted molecular weights of the immature and mature ferritin were calculated to be 20.3 kDa and 18.2 kDa, respectively. The region encoding the mature ferritin was subcloned into the pT7-7 expression vector after PCR amplification using the designed primers and included the initiation and termination codons; the recombinant clones were expressed in E. coli BL21(DE3) or E. coli BL21(DE3)pLysE. SDS-PAGE and western blot analysis showed that a ferritin of approximately 18 kDa (mature form) was produced and that by iron staining in native PAGE, it is likely that the recombinant ferritin is correctly folded and assembled into a homopolymer composed of a single subunit.

• Microbiology and Biotechnology Letters
• /
• v.30 no.4
• /
• pp.312-319
• /
• 2002

The Sporosarcina psychrophilia pyrB gene, which encodes aspartate transcarbamylase (ATcase), was cloned on Sau3AI restriction endonuclease fragment inserted into pUC19 plasmid vector, S. psychrophilia pyrB gene was expressed in Escherichia coli pyrB mutant for the complementation test. The sequence of 2,606 nucleotides including putative pyrB gene was determined. The region contained one full open reading frame (ORf) and two partial ORFs. The deduced amino acid sequence of the second ORF showed 59% identity with that of Bacillus caldolyticus ATCase. The first and third partial ORFs were closely related to the uracil permease (pyrP) and dihydroorotase (pyrC), respectively. Besides, potential terminator, antiterminator, and anti-antiterminator structures were found in the intergenic region between pyrP and pyrB. These results suggested that S. psychrophilia pyrimidine nucleotide biosynthesis genes are clustered as well as other Bacillus sp. Over-expressed product of pyrB encoding ATCase was purified and analyzed by the SDS-PAGE. The purified PyrB protein turned out to be molecular mass of 27 kDa and showed ATCase activity.

• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.628-635
• /
• 2018

In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

• Molecules and Cells
• /
• v.37 no.2
• /
• pp.161-171
• /
• 2014

In several lysosomal storage disorders, including Niemann-Pick disease Type C (NP-C), sphingolipids, including glycosphingolipids, particularly gangliosides, are the predominant storage materials in the brain, raising the possibility that accumulation of these lipids may be involved in the NP-C neurodegenerative process. However, correlation of these accumulations and NP-C neuropathology has not been fully characterized. Here we derived NP-C mice with complete and partial deletion of the Siat9 (encoding GM3 synthase) gene in order to investigate the role of ganglioside in NP-C pathogenesis. According to our results, NP-C mice with homozygotic deletion of GM3 synthase exhibited an enhanced neuropathological phenotype and died significantly earlier than NP-C mice. Notably, in contrast to complete depletion, NP-C mice with partial deletion of the GM3 synthase gene showed ameliorated NP-C neuropathology, including motor disability, demyelination, and abnormal accumulation of cholesterol and sphingolipids. These findings indicate the crucial role of GM3 synthesis in the NP-C phenotype and progression of CNS pathologic abnormality, suggesting that well-controlled inhibition of GM3 synthesis could be used as a therapeutic strategy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1531-1536
• /
• 2016

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1092-1097
• /
• 2005

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about $20\%$ power dissipation than a previous Booth multiplier.

• Journal of the Institute of Convergence Signal Processing
• /
• v.20 no.2
• /
• pp.84-90
• /
• 2019

Tremendous computation of full search or lossless motion estimation algorithms for video coding has led development of many fast motion estimation algorithms. We still need proper control of computation and prediction quality. In the paper, we suggest an algorithm that reduces computation effectively and controls computational amount and prediction quality, while keeping prediction quality as almost the same as that of the full search. The proposed algorithm uses multiple thresholds for partial block sum and times of counting unchanged minimum position for each step. It also calculates the partial block matching error, removes impossible candidates early, implements fast motion estimation by comparing times of keeping the position of minimum error for each step, and controls prediction quality and computation easily by adjusting the thresholds. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1256-1261
• /
• 2005

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about $20\%$ power dissipation than a previous Booth multiplier.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.496-512
• /
• 2007

In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.18 no.2
• /
• pp.62-67
• /
• 2017

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.