• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• Korean Journal of Mathematics
• /
• v.17 no.1
• /
• pp.83-90
• /
• 2009

In this paper, we investigate isomorphisms between $C^*$-ternary algebras and derivations on $C^*$-ternary algebras associated with the Cauchy-Jensen functional equation $$2f(\frac{x+y}{2}+z)=f(x)+f(y)+2f(z)$$, which was introduced and investigated by Baak in [2].

• Honam Mathematical Journal
• /
• v.32 no.3
• /
• pp.375-387
• /
• 2010

The paper studies an existence problem of a (generalized) universal covering space over a digital wedge with a compatible adjacency. In algebraic topology it is well-known that a connected, locally path connected, semilocally simply connected space has a universal covering space. Unlike this property, in digital covering theory we need to investigate its digital version which remains open.

• Honam Mathematical Journal
• /
• v.30 no.2
• /
• pp.207-217
• /
• 2008

Digital geometry has strongly contributed to the study of a discrete topological space $X{\subset}{\mathbf{Z}}^n$ with k-adjacency of ${\mathbf{Z}}^n$. As a survey-type article, we review various utilities of digital geometry.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1169-1183
• /
• 2015

We describe generalized Cayley graphs of rectangular groups, so that we obtain (1) an equivalent condition for two Cayley graphs of a rectangular group to be isomorphic to each other, (2) a necessary and sufficient condition for a generalized Cayley graph of a rectangular group to be (strong) connected, (3) a necessary and sufficient condition for the colour-preserving automorphism group of such a graph to be vertex-transitive, and (4) a sufficient condition for the automorphism group of such a graph to be vertex-transitive.

• Journal of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1065-1087
• /
• 1997

We prove that there exists a canonical level-preserving isomorphism between the stable Morse homology (or the Morse homology of generating functions) and the Floer homology on the cotangent bundle $T^*M$ for any closed submanifold $N \subset M$ for any compact manifold M.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.71-80
• /
• 2001

The purpose of this paper is to give the classification of homogeneous integral table algebras of degree 5 containing a faithful real element of which 2. In fact, these algebras are classified to exact isomorphism, that is the sets of structure constants which arise from the given basis are completely determined. This is work towards classifying homogeneous integral table algebras of degree 5. AMS Mathematics Subject Classification : 20C05, 20C99.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.4
• /
• pp.785-803
• /
• 2004

We research properties of analytic functions which are exponentially decreasing or increasing. Also we show that the space of test functions is dense in the space of extended Fourier hyper-functions, and that the Fourier transform of the space of extended Fourier hyperfunctions into itself is an isomorphism and Parseval's inequality holds.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.591-611
• /
• 2001

In this paper, we classify elliptic curve by isomorphism classes over some finite fields. We consider finite field as a quotient ring, saying $\mathbb{Z}[i]/{\pi}\mathbb{Z}[i]$ where $\pi$ is a prime element in $\mathbb{Z}[i]$. Here $\mathbb{Z}[i]$ is the ring of Gaussian integers.