• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.264-267
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However dynamic programming cannot be applied to certain cost function due its drawback and to produce optimal multiple sequence alignment. We proposed sub-alignment refinement algorithm to overcome the problem of dynamic programming and impelmented this algorithm as a module of our MS Windows-based sequence alignment program.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.51-57
• /
• 2010

In this paper we introduce and study the lacunary strong Zweier sequence spaces $N_{\theta}^O[Z]$, $N_{\theta}[Z]$ consisting of all sequences x = $(x_k)$ such that (Zx) in the space $N_{\theta}$ and $N_{\theta}^O$ respectively, which is normed. Also, prove that $N_{\theta}^O[Z}$, $N_{\theta}[Z}$, are linearly isomorphic to the space $N_{\theta}^O$ and $N_{\theta}$, respectively. And we study some connections between lacunary strong Zweier sequence and lacunary statistical Zweier convergence sequence.

• Kyungpook Mathematical Journal
• /
• v.54 no.3
• /
• pp.425-441
• /
• 2014

In this paper, we first present the properties of the graph which maximize the spectral radius among all graphs with prescribed degree sequence. Using these results, we provide a somewhat simpler method to determine the unicyclic graph with maximum spectral radius among all unicyclic graphs with a given degree sequence. Moreover, we determine the bicyclic graph which has maximum spectral radius among all bicyclic graphs with a given degree sequence.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.235-244
• /
• 1996

For a self-map f of a CW-pair (X, A), we introduce the G(f)-sequence of (X, A) which consists of subgroups of homotopy groups in the homotopy sequence of (X, A) and show some properties of the relative homotopy Jian groups. We also show a condition for the G(f)-sequence to be exact.

• Communications of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.429-437
• /
• 2019

Dilcher and Stolarsky [1] recently studied a sequence resembling the Chebyshev polynomials of the first kind. In this paper, we follow their some research directions to the Chebyshev polynomials of the second kind. More specifically, we consider a sequence resembling the Chebyshev polynomials of the second kind in two different ways, and investigate its properties including relations between this sequence and the sequence studied in [1], zero distribution and the irreducibility.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.69-83
• /
• 2022

We investigate the concept of lacunary statistical convergence and lacunary strongly convergence for sequence of sets in intuitionistic fuzzy metric space (IFMS) and examine their characterization. We obtain some inclusion relation relating to these concepts. Further some necessary and sufficient conditions for equality of the sets of statistical convergence and lacunary statistical convergence for sequence of sets in IFMS have been established. The concept of strong Cesàro summability in IFMS has been defined and some results are established.

• Journal of Microbiology and Biotechnology
• /
• v.1 no.1
• /
• pp.45-49
• /
• 1991

The complete nucleotide sequence of alkalophilic Bacillus sp. K-17 $\beta$-xylosidase gene and its flanking regions were established. A 1263-bp of an open reading frame for $\beta$-xylosidase was observed. The molecular weight (50, 521 dalton), deduced from the nucleotide sequence of $\beta$-xylosidase gene, agreed with the result obtained by SDS-polyacrylamide gel electrophoresis of the purified enzyme (51, 000 dalton). The Shine-Dalgarno sequence, 5'-GAGGAGG-3', was found 8 bp upstream of the initiation codon ATG. The -10 sequence (TAAAAT) in the promoter region for $\beta$-xylosidase gene was similar to the consensus sequence for Bacillus subtilis RNA polymerase, whereas the -35 sequence (TCGATCA) different from all the known -35 regions in the promoter for Bacillus subtilis RNA polymerase.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.9
• /
• pp.460-466
• /
• 2002

A reliable fault phase selection algorithm plays a very important role in transmission line protection, Particularly in Extra High Voltage (EHV) networks. The conventional fault phase selection algorithm used the phase difference between positive and negative sequence current excluding load current. But, it is difficult to pick out only fault current since we can not know when a fault occurs and select the fault phase in weak-infeed conditions that dominate zero-sequence current in phase current. The proposed algorithm can select the accurately fault phase using the sum of unit vectors which are calculated by positive-sequence voltage and negative-sequence voltage.

• Honam Mathematical Journal
• /
• v.41 no.4
• /
• pp.725-744
• /
• 2019

In this paper we introduce some new types of double difference sequence spaces defined by a new definition of convergence of double sequences and a double series with the help of sequence of Orlicz functions and a four dimensional bounded regular matrices A = (a_rtkl). We also make an effort to study some topological properties and inclusion relations between these sequence spaces. Finally, we compute the closed ideals in the space 𝑙²_∞.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.554-561
• /
• 2001

Wavelet transformation method which has special qualities of frequency domain and spatial domain is used for watermarking. We have compared the decree of similarity to find a robust watermarking sequence for different attacks, using random number, gaussian sequence, chaos sequence and sobel sequence. The experimental results show that chaos sequence is an effective sequence for robust watermarking.