• Korean Journal of Plant Taxonomy
• /
• v.40 no.3
• /
• pp.157-162
• /
• 2010

Sequences of the trnL/F intergenic spacer of chloroplast DNA were used to investigate the intraspecific evoution and phylogeography of Sedum takesimense (Crassulaceae). The trnL/F intergeneric spacer sequences from 32 individuals of S. takesimense were either 291 bp (17 samples "without indel" in the following) or 297 bp (15samples "with indel 1") in length due to an indel of 6 bp. Two main cpDNA haplotypes were detected within S. takesimense. The haplotype with indel was found on Ulleung Island and without indel on Ulleung Island and Dok Island. This confirmed the existence of two cpDNA lineages with different geographical distributions. The cpDNA sequence analysis also suggested a putative long-distance dispersal event between Ulleung Island and Dok Island.

• The Korean Journal of Mycology
• /
• v.48 no.3
• /
• pp.313-323
• /
• 2020

To investigate the morphological characteristics and genetic relationships among isolate of the artificially cultivated mushroom Hypsizygus marmoreus, 111 isolates were collected from Korea and other countries. Random amplified polymorphic DNA polymerase chain reaction (RAPD-PCR) and ITS rDNA sequencing were used to confirm the genetic relationships among the collected H. marmoreus isolates. As a result of RAPD analysis using universal rice primer (URP)-PCR, all isolates of H. marmoreus clustered into three groups, which showed high sequence similarity (>90%). In addition, isolates with morphological and geographical differences formed independent clusters. However, it was impossible to distinguish between brown and white strains. Sixteen strains showing morphological and geographic differences were selected, and their ITS region sequences (640 bp) were aligned and compared. The ITS region sequences belonging to these isolates showed 94.8-99.1% similarities to those of publicly available H. marmoreus strains in GenBank. In conclusion, there were differences among isolates in terms of morphology and the area from which they were collected, but all the isolates used in the experiment were classified as H. marmoreus.

• Korean Journal of Plant Resources
• /
• v.23 no.4
• /
• pp.293-302
• /
• 2010

Taxa of Artemisia collected in Korea were constructed by molecular phylogenetic analysis based on the internal transcribed spacer(ITS) regions of nrDNA. The length of the ITS sequences aligned using the clustal X program was 636~643 bp, and the lengths of the ITS1 and ITS2 regions were 251~255 bp and 217~222 bp, respectively. The total number of variable sites was 95 for the entire sequence, and a parsimony- informative site represented an efficacious site in ITS1 rather than in ITS2. The maximum parsimony tree as calculated by the MEGA 4 program was clustered into five clades. The taxa(A. capillaris, A. japonica var. japonica, A. japonica var. hallaisanensis, A. japonica subsp. littoricora) degenerated ovary of clade 1 was supported as the subgenus Dracunculus by Ling's classification system. The results show that A. nakaii and A. fukudo were quite similar genetically(Boostrap 99%) and that the scientific name of Korean A. dubia should be reconsidered. A. sp. distributed in Ganghwa province was grouped with A. argyi(Boostrap 89%). These results suggest that the molecular techniques used in this study could be useful for the phylogenetic analysis of Korean Artemisia herbs having variations in their morphological characteristics.

• Journal of Internet Computing and Services
• /
• v.4 no.2
• /
• pp.69-80
• /
• 2003

Program Behavior Intrusion Detection Technique analyses system calls that called by daemon program or root authority, constructs profiles, and detectes modificated anomaly intrusions effectively. In this paper, the relation among system calls of processes is represented by bayesian network and Multiple Sequence Alignment. Program behavior profiling by Bayesian Network classifies modified anomaly intrusion behaviors, and detects anomaly behaviors. we had simulation by proposed normal behavior profiling technique using UNM data.

• Review of KIISC
• /
• v.18 no.5
• /
• pp.62-72
• /
• 2008

인터넷 뱅킹은 인터넷을 통해 금융 업무를 처리하는 시스템으로, 시 공간적 제약이 없어 이용자가 크게 증가하고 있지만 인터넷을 기반으로 한 웹 공격으로 인하여 많은 위협을 받고 있다. 인터넷 뱅킹은 서비스를 제공하는 은행에 따라 사용자 인터페이스와 처리 방법이 매우 다양하므로, 인터넷 뱅킹 시스템을 목표로 한 웹 공격을 탐지하기 위해서는 해당 인터넷 뱅킹 서비스의 특징을 반영할 수 있는 고유의 패턴을 생성해야 한다. 본 논문에서는 서열 정렬 알고리즘을 이용하여 인터넷 뱅킹 이용에 대한 정상 및 비정상 패턴을 자동으로 생성하여 웹 공격을 탐지하고 분석하는 방법을 제안한다. 제시한 방법의 성능 평가를 위하여, 모의 인터넷 뱅킹 프로그램을 설치한 후 정상적인 이용과 웹 공격을 시도한 자료를 구분하여 수집하고 유사도를 측정하였다. 실험결과 제안된 기법이 오탐율이 낮고 탐지 성능 또한 뛰어남을 확인하였다. 그리고 전문가의 도움 없이 정상 패턴과 비정상 패턴을 생성할 수 있어 효율적으로 변형된 공격이나 새로운 공격을 차단하고 비정상 행위에 판단에 대한 근거를 제시할 수 있음을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.397-400
• /
• 2010

우리는 지난 연구에서 변형 비속어 필터링 시스템을 위하여 근사 문자열 검색 시스템을 적용하여 서열 정렬 횟수를 비약적으로 줄일 수 있었다. 다차원 데이터 구조를 이용한 한글 근사 검색 시스템은 기준축인 Base-Pivot의 숫자에 따라 검색 결과의 정확도를 높일 수 있으나 BP이 증가한 만큼 질의 단어의 좌표를 계산하기 위한 시간이 오래 걸린다. 소규모 데이터 검색에는 문제가 되지 않으나 60,000단어 이상의 데이터가 수록되는 국어사전과 같은 대규모 데이터를 검색하게 될 경우 요구되는 BP의 숫자도 증가하여 많은 연산시간을 필요로 한다. 본 논문에서는 기존의 근사 단어 검색 시스템을 계층구조화 하여 요구되는 BP 숫자를 감소 시켜 성능을 향상 시키는 방법을 제안하고자 한다. 그리고 실험을 통하여 본 아이디어의 실효성을 증명하였다. 본 아이디어는 기존의 6000개의 비속어에 대하여 약 20%정도의 성능향상을 보였다.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.82-87
• /
• 2006

The most popular protein structure prediction method is comparative modeling. To guarantee accurate comparative modeling, the sequence alignment between a query protein and a template should be accurate. Although choosing the best template based on the protein sequence alignments is most critical to perform more accurate fold-recognition in comparative modeling, even more critical is the sequence alignment quality. Contrast to a lot of attention to developing a method for choosing the best template, prediction of alignment accuracy has not gained much interest. Here, we develop a method for prediction of the shift score, a recently proposed measure for alignment quality. We apply support vector regression (SVR) to predict shift score. The alignment between a query protein and a template protein of length n in our own library is transformed into an input vector of length n +2. Structural alignments are assumed to be the best alignment, and SVR is trained to predict the shift score between structural alignment and profile-profile alignment of a query protein to a template protein. The performance is assessed by Pearson correlation coefficient. The trained SVR predicts shift score with the correlation between observed and predicted shift score of 0.80.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1007-1012
• /
• 2014

Software birthmarks are used to detect software plagiarism. For binaries, however, only a few birthmarks have been developed. In this paper, we propose a static approach to generate API sequences along major paths, which are analyzed from control flow graphs of the binaries. Since our API sequences are extracted along the most plausible paths of the binary codes, they can represent actual API sequences produced from binary executions, but in a more concise form. Our similarity measures use the Smith-Waterman algorithm that is one of the popular sequence alignment algorithms for DNA sequence analysis. We evaluate our static path-based API sequence with multiple versions of five applications. Our experiment indicates that our proposed method provides a quite reliable similarity birthmark for binaries.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1067-1072
• /
• 2016

Software birthmarks, which are unique characteristics of the software, are used to detect software plagiarism or software similarity. Generally, software birthmarks are divided into static birthmarks or dynamic birthmarks, which have evident pros and cons depending on the extraction method. In this paper, we propose a method for extracting the API sequence birthmarks using a dynamic analysis and similarity detection between the executable codes. Dynamic birthmarks based on API sequences extract API functions during the execution of programs. The extracted API sequences often include all the API functions called from the start to the end of the program. Meanwhile, our dynamic birthmark scheme extracts the API functions only called directly from the executable code. Then, it uses a sequence alignment algorithm to calculate the similarity metric effectively. We evaluate the birthmark with several open source software programs to verify its reliability and credibility. Our dynamic birthmark scheme based on the extracted API sequence can be utilized in a similarity test of executable codes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.1-8
• /
• 2009

Oligonucleotide design is known as a time-consuming work in Bioinformatics. In order to accelerate the oligonucleotide design process, one of the most widely used approaches is the prescreening unreliable regions using hashing(or seeding) method represented by BLAST. Since the seeding is originally proposed to increase the sensitivity for local alignment, the specificity should be considered as well as the sensitivity for the oligonucleotide design problem. However, a measure of evaluating the seeds regarding how adequate and efficient they are in the oligo design is not yet proposed. we propose a novel measure of evaluating the seeding algorithms based on the discriminability and the efficiency. By the proposed measure, five well-known seeding algorithms are examined. The spaced seed is recorded as the best efficient discriminative seed for oligo design.