• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2008.04a
• /
• pp.13-16
• /
• 2008

Dynamic Programming (DP)을 이용한 서열 비교 알고리즘은 DNA, RNA, 단백질 서열의 비교와 프로그래밍 소스 코드 유사도를 측정하는 곳 등에 널리 사용되어 왔다. 이 알고리즘은 DP를 이용하여 행렬을 구성한 후, 행렬의 가장 마지막 생성 값을 이용해 두 서열의 유사도를 측정하는 방법이다. 그러나 이 알고리즘에서 사용하는 마지막 생성 값은 비교 서열이 길이에 따라 크게 좌우되기 때문에 다양한 서열들의 유사도를 알아내기에는 부적합하다. 본 논문에서는 서열의 길이에 무관한 유사도 측정 (S2) 알고리즘을 제안한다. 제안된 알고리즘을 이용하면 비교 서열의 길이에 영향을 받지 않고 정당한 서열 비교를 할 수 있다. 제안된 알고리즘의 검증을 위해 본 논문에서는 프로그램 소스 코드의 유사도 측정을 수행한다.

• Journal of Plant Biotechnology
• /
• v.36 no.4
• /
• pp.397-402
• /
• 2009

Ornithinine carbamoyltransferase (OTC) is an enzyme that catalyzes the key step in arginine biosynthesis in bacteria and plants. OTC is also involved in the urea cycle and deficiency of the enzyme in human leads to disease. The argF gene encoding OTC has been reported in many bacteria and few plants. Here we report the characterization of a gene encoding OTC from rice (OsOTC). Analysis of a cDNA sequence from rice revealed that the full-length open reading frame of OsOTC consisted of 367 amino acids, corresponding to a protein of approximately 39.7 kDa. The predicted amino acid sequence of OsOTC harbor distinct five OTC signature sites and is highly homologous to that of enzymes of plants, animals and many bacterial OTCs. Expression of OsOTC in argF mutants of Escherichia coli showed that the gene was able to functionally complement to the mutant. These results suggest that the OsOTC encode a protein for ornithine carbamoyltransferase in rice.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1824-1830
• /
• 1998

In this paper, we investigate a noise reduction scheme, based on the inherent characteristic of an orthogonal sequence. The modulated orthogonal code generates sequences of length $N^{2}$ from N information symbols. Using the amplitudes of the received symbols, we first estimate the location of the smallest amplitude noise. Then the noise is reduced by the suggested system. The performance of the scheme is confirmed by computer simulation results.

• Molecules and Cells
• /
• v.20 no.3
• /
• pp.348-353
• /
• 2005

Using in silico approaches and RACE we cloned a full length trinucleotide (CAG) repeat-containing cDNA (cag-3). The cDNA is 2478 bp long and the deduced polypeptide consists of 140 amino acids of which 73 are glutamines. The genomic sequence spans approximately 79 kb on mouse chromosome 7 and the gene is composed of four exons. Standard and real-time PCR analyses of several mouse tissues showed that the gene is exclusively expressed in the brain and is not detected in embryonic stages. Within the brain, it is expressed throughout the forebrain region with predominant expression in the hypothalamus and olfactory bulb and very low levels in the mid- and hindbrain.

• Molecules and Cells
• /
• v.19 no.3
• /
• pp.318-327
• /
• 2005

Southern blot analysis revealed a ubiquitous distribution and high copy number of Ty3-gypsy-like elements in the genome of Hibiscus syriacus. Comparative phylogenetic analysis of the large subunit of Rubisco and the integrase region of Ty3-gypsy elements in various plant species indicated that the retrotransposon-like sequences have different evolutionary histories and their own unique polymorphism in the H. syriacus population. Sequence-tagged site-restriction fragment length polymorphisms (STS-RFLP) analysis also indicated great variability in the numbers and sequences of Ty3-gypsy-like elements within H. syriacus varieties. Ty3-gypsy-like elements may still be active within H. syriacus, since Northern analysis of wounded leaves of H. syriacus variety Saehan with a probe for the integrase domain gave strong hybridization signals. The sequence heterogeneity and ubiquity of the Ty3-gypsy-like elements in H. syriacus genomes could provide reliable DNA markers for line identification as well for the analysis of genetic diversity in H. syriacus.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.713-724
• /
• 2005

This paper focuses on the problem of key-frames coding and proposes a new promising approach based on the use of fractals. The summary, made of a set of key-frames selected from a full-length video sequence, is coded by using a 3D fractal scheme. This allows the video presentation tool to expand the video sequence in a "natural" way by using the property of the fractals to reproduce the signal at several resolutions. This feature represents an important novelty of this work with respect to the alternative approaches, which mainly focus on the compression ratio without taking into account the presentation aspect of the video summary. In devising the coding scheme, we have taken care of the computational complexity inherent in fractal coding. Accordingly, the key-frames are first wavelet transformed, and the fractal coding is then applied to each subband to reduce the search range. Experimental results show the effectiveness of the proposed approach.

• Journal of Positioning, Navigation, and Timing
• /
• v.8 no.1
• /
• pp.13-18
• /
• 2019

This paper analyzes the signal acquisition performance of the legacy GNSS spreading codes and a polyphase code. The code length and chip rate of a polyphase code are assumed to be same as those of the GPS L1 C/A and Galileo E1C codes. The autocorrelation and cross correlation characteristics are analyzed. In addition, a way to calculate a more accurate probability of false alarm for a code with sidelobe non-zero auto-correlation function is proposed. Finally, we estimate the probability of detection and the mean acquisition time for a given signal strength and the probability of false alarm.

• Entomological Research
• /
• v.48 no.5
• /
• pp.339-347
• /
• 2018

Seven different strains of Beauveria bassiana were used in a bioassay on Pieris rapae larvae. The results showed that an B. bassiana strain showed relatively high pathogenicity towards P. rapae larvae. The adjusted mortality rate was 92.86 %, and the infection rate was 85.71 % in 10 days post inoculation. Molecular identification was performed to identify the unknown strain. Internal Transcribed Spacer sequence analysis showed that the polymerase chain reaction amplicon length of the unknown strain of Beauveria sp. was 573 bp, and sequence similarity to the known B. bassiana sequences in the NCBI database was 99 %. The B. bassiana strain was named Bb01. The changes of proteins and PPO of P. rapae larvae infected by B. bassiana Bb01 strain at different times was determined. The activity of PPO increased in 1-6 d and decreased in 7 d again after inoculation. The B. bassiana invaded into the insect body affected the balance of the proteins and PPO.

• Journal of Species Research
• /
• v.11 no.3
• /
• pp.188-193
• /
• 2022

Araeosoma owstoni Mortensen, 1904, a newly recorded sea urchin, was collected from the Korea Strait by trawling during a research expedition in April 2017. The specimen was damaged and was severely peeled off on the aboral side during trawling. However, a test and the surface of the oral side of the sample were well preserved, allowing us to successfully identify it. The species was distinguished by the large and flexible test, the tiny apical section, and the interambulacra width which is twice of the ambulacra. Pedicellaria tridentate and triphyllous were presents, but tetradactyle pedicellaria was absent due to severe peeling on the aboral side. Moreover, a length of 1,212 bp sequence from mitochondrial COI gene was obtained and this sequence covered the general DNA barcoding region. The mean of interspecific divergence within A. owstoni from Korea and other eight species of Araeosoma from the GenBank was 6.8%. This value indicated that our species was clearly distinguishable from the others. Thus, the first Araeosoma species occurring in South Korea is presented in this study.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.93-96
• /
• 2022

DTW can eliminate gaps between sequences of different lengths and find out the similarity of patterns, but due to the time and space complexity, it requires a high computational cost on large datasets. In this paper, we propose a DDTW algorithm that not only reduces computational costs but also has no error in the results. In addition, the algorithm complexity of DTW and DDTW is compared by measuring the computational time according to the length of the sequence. Simulation results show a noticeable reduction in computational time in DDTW compared to DTW.