• Korean Journal of Agricultural Science
• /
• v.36 no.2
• /
• pp.159-165
• /
• 2009

This study was conducted to identify the PERV (Porcine Endogenous Retrovirus) integration sites and their characterizations using the porcine genomic sequence information. Total 114 Mb (4.2%) sequence of the 2.7 Gb pig genome was investigated for the PERV sequences. As the results, 8 PERV sequences were identified and their genomic structures were deduced from the BLAST searches against previously known PERV genes. Seven PERVs have internal deletions in the protein coding region and they will not be functional. The other one also has internal deletions in the gag and env genes, indicating this PERV is also defective. Even though we could not identify the functional PERVs in this study, the results presented here can be used for the fundamental research materials for controlling PERV infections in relation to xenotransplantation using porcine organs and tissues.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2357-2363
• /
• 1997

In this paepr, we show that the length of the test sequence can be reduced using non-minimal multiple UIO instead of minimal multiple UIO. Our test sequence generation method starts from the observation that Shen's approach cannot optimize the length of the test sequence whtn the difference between the number of incoming edge and that of outgoing edge is large. Usig the property, we propse a more efficient method to generate a UIO-based test sequence in terms of the length, and compares our method with other existing methods in terms of execution time for comformancetesting and time for generation of test sequence.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2201-2216
• /
• 2015

Peak to average power ratio (PAPR) is one of the main imperfections in the broadband communication systems with multiple carriers. In this paper, a new crest factor reduction (CFR) scheme based on interleaved phase sequence called Dummy Sequence Insertion Enhanced Partial Transmit Sequence (DSI-EPTS) is proposed which effectively reduces the PAPR while at the same time keeps the total complexity low. Moreover, the prototype of the proposed scheme in field programmable gate array (FPGA) is demonstrated. In DSI-EPTS scheme, a new matrix of phase sequence is defined which leads to a significant reduction in hardware complexity due to its less searching operation to extract the optimum phase sequence. The obtained results show comparable performance with slight difference due to the FPGA constraints. The results show 5 dB reduction in PAPR by applying the DSI-EPTS scheme with low complexity and low power consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.874-879
• /
• 2008

In this paper, a new extending method of q-ary low correlation zone(LCZ) sequence sets is proposed, which is a generalization of binary LCZ sequence set by Kim, Jang, No, and Chung. Using this method, q-ary LCZ sequence set with parameters (N,M,L,${\epsilon}$) is extended as a q-ary LCZ sequence set with parameters (pN,pM,p[(L+1)/p]-1,p${\epsilon}$), where p is prime and p|q.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.372-380
• /
• 2003

Temporal databases support time-varying events so that conventional aggregate functions are extended to be processed with time for temporal aggregate functions. In the previous approach, it is done repeatedly to find time intervals and is calculated the result of each interval whenever target events are different. This paper proposes a method which processes temporal aggregate function queries using time point sequence. We can make time point sequence storing the start time and the end time of events in temporal databases in advance. It is also needed to update time point sequence due to insertion or deletion of events in temporal databases. Because time point sequence maintains the information of time intervals, it is more efficient than the previous approach when temporal aggregate function queries are continuously requested, which have different target events.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.2
• /
• pp.417-437
• /
• 2022

The quality of the fuzzing seed file is one of the important factors to discover vulnerabilities faster. Although the prior seed generation paradigm, using dynamic taint analysis and symbolic execution techniques, enhanced fuzzing efficiency, the yare not extensively applied owing to their high complexity and need for expertise. This study proposed the DDRFuzz system, which creates seed files based on sequence-to-sequence models. We evaluated DDRFuzz on five open-source applications that used multimedia input files. Following experimental results, DDRFuzz showed the best performance compared with the state-of-the-art studies in terms of fuzzing efficiency.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.554-554
• /
• 2006

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.118-127
• /
• 2014

DNA data storage refers to any technique for storing massive digital data in base sequence of DNA and has been recognized as the future storage medium recently. This paper presents an information hiding method for DNA data storage that the massive data is hidden in non-coding strand based on DNA steganography. Our method maps the encrypted data to the data base sequence using the numerical mapping table and then hides it in the non-coding strand using the key that consists of the seed and sector length. Therefore, our method can preserve the protein, extract the hidden data without the knowledge of host DNA sequence, and detect the position of mutation error. Experimental results verify that our method has more high data capacity than conventional methods and also detects the positions of mutation errors by the parity bases.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.91-101
• /
• 2012

DNA watermarking have been interested for both the security of private genetic information or huge DNA storage information and the copyright protection of GMO. Multimedia watermarking has been mainly designed on the basis of frequency domain, such as DCT, DWT, FMT, and so on, for the robustness and invisibility. But a frequency domain watermarking for coding DNA sequence has a considerable constraint for embedding the watermark because transform and inverse transform must be performed without completely changing the amino acid sequence. This paper presents a coding sequence watermarking on lifting based DWT domain and brings up the availability of frequency domain watermarking for DNA sequence. From experimental results, we verified that the proposed scheme has the robustness to until a combination of 10% point mutations, 5% insertion and deletion mutations and also the amino preservation and the security.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.26-32
• /
• 2018

The protein secondary structures are important information for studying the evolution, structure and function of proteins. Recently, deep learning methods have been actively applied to predict the secondary structure of proteins using only protein sequence information. In these methods, widely used input features are protein profiles transformed from protein sequences. In this paper, to obtain an effective protein profiles, protein profiles were constructed using protein sequence search methods such as PSI-BLAST and HHblits. We adjust the similarity threshold for determining the homologous protein sequence used in constructing the protein profile and the number of iterations of the profile construction using the homologous sequence information. We used the protein profiles as inputs to convolutional neural networks and recurrent neural networks to predict the secondary structures. The protein profile that was created by adding evolutionary information only once was effective.