• Journal of Microbiology and Biotechnology
• /
• v.26 no.8
• /
• pp.1473-1480
• /
• 2016

This study focused on the variations in the non-coding sequences between ctxB and rstR of various CTX phages. The non-coding sequences of CTX-1 and CTX-cla are phage type-specific. The length of the non-coding region of CTX-1 and CTX-cla is 601 and 730 nucleotides, respectively. The non-coding sequence of CTX phage could be divided into three regions. There is a phage type-specific Variable region between two homologous Common regions (Common regions 1 and 2). The non-coding sequence of RS1 element is similar to CTX-1 except that Common region 1 is replaced by a short RS1-specific sequence. The non-coding sequences of CTX-2 and CTX-cla are homologous, indicating the non-coding sequence of CTX-2 is derived from CTX-cla. The non-coding region of CTX-O139 is similar to CTX-cla and CTX-2; however, it contains an extra phage type-specific sequence between Common region 2 and rstR. The variations in the non-coding sequences of CTX phages might be associated with the difference in the replication efficiency and the directionality in the integration into the V. cholerae chromosome.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.24-33
• /
• 2009

The transition of auxiliary lines for transmitting coding information has been one of the major obstacles to restricting the scalability of Sequence Switch Coding (SSC) algorithms. A new design of SSC which does not use auxiliary lines is presented in this paper. The new design makes overhead transitions far less than the previous designs that use auxiliary lines. By applying the new technique, more than 50% of overhead transitions have been reduced, leading to the increase of 30% of the overall efficiency of SSC algorithm.

• Microbiology and Biotechnology Letters
• /
• v.25 no.1
• /
• pp.23-29
• /
• 1997

The nucleotide sequence of the estI gene encoding acetylxylan esterase I of Bacillus stearothermophilus was determined and analyzed. The estI gene was found to consist of a 810 base pair open reading frame coding for a polypeptide of 270 amino acids with a deduced molecular weight of 30 kDa. This was in well agreement with the molecular weight (29 kDa) estimated by SDS-PAGE of the purified esterase. The coding sequence was preceded by a putative ribo some binding site 10 bp upsteam of the ATG codon. Further 53 bp upstream, the transcription initiation signals were identified. The putative $_{-}$10 sequence (TCCAAT) and $_{-}$35 seqence (TTGAAT) corresponded closely to the respective consensus sequences for the Bacillus subtiis major RNA polymerase. The G+C content of the coding region of the estI was 51% whereas that of the third position of codone was 60.2%. The N-terminal amino acid sequence of the EstI deduced from the nucleotide sequence perfectly matched the corresponding region of the purified esterase described previously. Comparison with the amino acid sequence of other esterases and lipases reported so far allowed us to identify a sequence, GLSMG at positions 123 to 127 of the EstI which was reported to be the highly conserved active site sequence for those enzymes. The nucleotide sequence of the estI revealed 55.7% homology to that of the xylC coding for the acetylxylan esterase of Caldocellum saccharolyticum.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.7
• /
• pp.71-79
• /
• 2004

Packet-type data transmission is characterized by the continuous transmission of massive data with relatively constant rate. In such transmission, the dynamic power consumed on buses is influenced by the sequence of transmitted data. A new coding scheme called Sequence-Switch Coding (SSC) is proposed in this paper. SSC reduces the number of bus transitions in the transmission of packet-type data by changing the sending order of the data. Some simple algorithms are presented, In. The simulation results show that SSC outperforms the well-known Bus-Invert Coding with these algorithms. SSC is not a specific algerian but a method to reduce the number of bus-transitions. There could be lots of algorithms for realizing SSC. The variety of SSC algorithms provides circuit designers a wide range of trade-off between performance and circuit complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.70-82
• /
• 1993

In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.93-105
• /
• 2001

In the lossless step of Lattice Vector Quantization(LVQ), the lattice codewords produced at quantization step are enumerated into radius sequence and index sequence. The radius sequence is run-length coded and then entropy coded, and the index sequence is represented by fixed length binary bits. As bit rate increases, the index bit linearly increases and deteriorates the coding performances. To reduce the index bits across the wide range of bit rates, we developed a novel lattice enumeration algorithm adopting the set partitioning method. The proposed enumeration method shifts down large index values to smaller ones and so reduces the index bits. When the proposed lossless coding scheme is applied to a wavelet based image coding, the proposed scheme achieves more than 10% at bit rates higher than 0.3 bits/pixel over the conventional lossless coding method, and yields more improvement as bit rate becomes higher.

• Journal of Microbiology and Biotechnology
• /
• v.5 no.3
• /
• pp.117-124
• /
• 1995

A gene (xynA) encoding the endo-xylanase (E.C.3.2.1.8) from Bacillus stearothermophilus was cloned in E. coli, and its complete nucleotide sequence was determined. The xynA gene consists of a 636 base pairs open reading frame coding for a protein of 212 amino acids with a deduced molecular weight of 23, 283 Da. A putative signal sequence of 27 amino acid residues shows the features comparable with the Bacillus signal sequences; namely, the signal contains a positively charged region close to the N-terminus followed by a long hydrophobic string. The coding sequence is preceded by a possible ribosome binding site with a free energy value of -16.6 kcal/mol and the transcription initiation signals are located further upstream. The translation termination codon (TAA) at the 3 end of the coding sequence is followed by two palindrome sequences, one of which is thought to act as a terminator. The xynA gene has a high GC content, especially in the wobble position of codons (64%). Comparison of the primary protein sequence with those of other xylanases shows a high homology to the xylanases belonging to family G.

• Journal of Animal Science and Technology
• /
• v.50 no.2
• /
• pp.177-184
• /
• 2008

Acid-labile subunit(ALS) is a 85-kDa glycosylated plasma protein which forms a 150-kDa ternary complex with 7.5-kDa insulin-like growth factor(IGF) and 40~45-kDa IGF-binding protein-3. In a previous study, the present authors prepared a porcine ALS(pALS) expression construct by inserting a pALS coding sequence into a plasmid vector following synthesis of the sequence by reverse transcription-polymerase chain reaction(RT-PCR). The expression construct, however, was subsequently found to have a mis-sense mutation at two bases of the pALS coding sequence which is presumed to have occurred through a PCR error. In the present study, the correct coding sequence was synthesized by the site-directed mutagenesis and inserted into the pET-28a(+) plasmid expression vector containing the His-tag sequence flanking the last codon of the insert DNA. After induction of the expression construct in E. coli BL21(DE3) cells, the resulting presumptive recombinant peptide was purified by the Ni-affinity chromatography. Upon SDS- PAGE, the affinity-purified peptide was resolved as a single band at a 66-kDa position which is consistent with the expected molecular mass of the presumptive recombinant pALS. Collectively, results indicate that a recombinant pALS peptide was successfully expressed and purified in the present study.