• BMB Reports
• /
• v.45 no.1
• /
• pp.14-19
• /
• 2012

A feruloyl esterase encoding gene (designated fae6), derived from a leachate metagenomic library, was cloned and the nucleotide sequence of the insert DNA determined. Translational analysis revealed that fae6 consists of a 515 amino acid poly-peptide, encoding a 55 kDa pre-protein. The Fae6 primary structure contained the G-E-S-A-G sequence, which corresponds well with a typical catalytic serine sequence motif (G-x-S-x-G). The fae6 gene was successfully over-expressed in E. coli and the recombinant protein was purified to 8.4 fold enrichment with 17% recovery. The $K_M$ data showed Fae6 has a high affinity to methyl sinapate while thermostability data indicated that fae6 was thermolabile with a half life ($T_{1/2}$) < 30 min at $50^{\circ}C$. High affinity for Fae6 against methyl sinapate, methyl ferulate and ethyl ferulate suggest that the enzyme can be useful in hydrolyzing ferulated polysaccharides in a biorefinery process.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2009.05a
• /
• pp.27-34
• /
• 2009

Since the late 1980s, the sequence stratigraphic method has become a critical tool for hydrocarbon exploration/development projects in many frontier and mature sedimentary basins. The successful application of this method with high resolution 3D seismic data and well data is particularly important in frontier and deepwater areas, where exploration risk and capital commitment are high. Many international major and national oil companies have been using sequence stratigraphic approach as one of the main interpretation tools for the evaluation of their high impact projects. Applied correctly, this integrated interpretation method is a powerful tool that can be used to unravel the complex stratigraphy of a given basin and to dramatically increase overall understanding of various depositional models for both siliciclastic and carbonate systems.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.4
• /
• pp.57-65
• /
• 1997

The purpose of this paper is to propose the HMM (hidden markov model) based on multi-observation sequence for the isolated word recognition. The proosed model generates the codebook of MSVQ by dividing each word into several sections followed by dividing training data into several sections. Then, we are to obtain the sequential value of multi-observation per each section by weighting the vectors of distance form lower values to higher ones. Thereafter, this the sequential with high probability value while in recognition. 146 DDD area names are selected as the vocabularies for the target recognition, and 10LPC cepstrum coefficients are used as the feature parameters. Besides the speech recognition experiments by way of the proposed model, for the comparison with it, the experiments by DP, MSVQ, and genral HMM are made with the same data under the same condition. The experiment results have shown that HMM based on multi-observation sequence proposed in this paper is proved superior to any other methods such as the ones using DP, MSVQ and general HMM models in recognition rate and time.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.155-164
• /
• 2003

A method is proposed to predict the distances between given residue pairs (between C$\sub$${\alpha}$/ atoms) of a protein using a sequence to structure mapping by indefinite quadratic approximation. The prediction technique requires a data fitting in three dimensional space with coordinates of the residues of known structured proteins and leads to a numerical ref resentation of 20 amino acids by minimizing a large least norm iteratively. These approximations are used in distance prediction for given residue pairs. Some computational experience on a test set of small proteins from Brookhaven Protein Data Bank are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.569-578
• /
• 2002

This paper proposes a new multicarrier code division multiple access (CDMA) system. The proposed multicarrier CDMA system provides the advantages that the transmission bandwidth is more efficiently utilized by using divided spreading sequence, time and frequency diversity is achieved in frequency selective nultipath (acting channel, and inter-carrier interference (ICI) can be minimized by using specific data and code pattern. In this system, transmitted data bits are serial-to-parallel converted to some parallel branches. On each branch each bit is direct-sequence spread-spectrum modulated by divided spreading sequences and transmitted using orthogonal carriers. The receiver providers a Rake for each carrier, and the outputs of Rakes are combined to get time and frequency diversity. This multicarrier CDMA system allows additional flexibility in the choice of system parameters. Upon varying system parameters, bit error rate (BER) performance is examined for the proposed multicarrier CDMA system. Simulation results show that the proposed multicarrier CDMA scheme can achieve better performance than the other types of conventional multicarrier CDMA systems.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2534-2536
• /
• 2002

This paper presents the design of high speed bit and word processor for sequence logic control using a FPGA. This FPGA is able to execute sequence instruction during program fetch cycle, because the program memory was separated from the data memory for high speed execution at 40MHz clock. Also this processor has 274 instructions set with a 32bit fixed width, so instruction decoding time and data memory interface time was reduced. This FPGA was synthesized by V600EHQ240 and Foundation tool of Xilinx company. The final simulation was successfully performed under Foundation tool simulation environment. And the FPGA programmed by VHDL for a 240 pin HQFP package. Finally the benchmark was performed to prove that the designed for bit and word processor has better performance than Q4A of Mitsubishi for the sequence logic control.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.2
• /
• pp.59-64
• /
• 2001

In this paper, we propose an alternate method for determining the uniqueness of the reconstruction of a complex sequence from its phase. Uniqueness constraints could be derived in terms of the zeros of a complex polynomial defined by the DFT of the sequence. However, rooting of complex polynomials of high order is a very difficult problem. Instead of finding zeros of a complex polynomial, the proposed uniqueness criteria show that non-singularity of a matrix can guarantee the uniqueness of the reconstruction of a complex sequence from its phase-only data. It has clear advantage over the rooting method in numerical stability and computational time.

• Genomics & Informatics
• /
• v.8 no.2
• /
• pp.97-99
• /
• 2010

To allow for a quick conversion of the proprietary sequence data from various sequencing platforms, sequence format conversion toolkits are required that can be easily integrated into workflow systems. In this respect, a format conversion tool, as well as quality conversion tool would be the minimum requirements to integrate reads from different platforms. We have developed the Pyrus NGS Sequencing Format Converter, a simple software toolkit which allows to convert three kinds of Next Generation Sequencing reads, into commonly used fasta or fastq formats. The converter modules are all implemented, uniformly, in Java GUI modules that can be integrated in software applications for displaying the data content in the same format.

• Journal of Information Technology and Architecture
• /
• v.9 no.1
• /
• pp.11-19
• /
• 2012

Generally, a suffix tree is an efficient data structure since it reveals the detailed internal structures of given sequences within linear time. However, it is difficult to implement a suffix tree for a large number of sequences because of memory size constraints. Therefore, in order to compare multi-mega base genomic sequence sets using suffix trees, there is a need to re-construct the suffix tree algorithms. We introduce a new method for constructing a suffix tree on secondary storage of a large number of sequences. Our algorithm divides three files, in a designated sequence, into parts, storing references to the locations of edges in hash tables. To execute experiments, we used 1,300,000 sequences around 300Mbyte in EST to generate a suffix tree on disk.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.76-79
• /
• 2004

The DS-SS (Direct Sequence Spread Spec1nun) transmitter is part of a low data rate (∼150 kbps - burst rate and 64 bps - average data rate) wireless communication system. It is traditionally implemented using Digital Signal processing chip (DSP). However, with rapid increase in variety of services through cell phones, such as, web access, video transfer, online games etc. demand for higher rate is increasing steadily. Since the chip rate and thereby the sampling rate requirements of the system are fairly high, the transmitter should implemented using Field programmable Gate Arrays FPGAs instead of a DSP. This paper shows the steps taken to get a working prototype of the transmitter unit on a FPGA based platform.