• Journal of KIISE:Databases
• /
• 제31권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.

• Journal of the Korean Data and Information Science Society
• /
• 제7권1호
• /
• pp.79-85
• /
• 1996

This paper will show that the rank of the model matrix of a closed, n compartmental model with k sinks is n-k. This statement will be extended to include open compartmental models as a part of theorem.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.851-860
• /
• 2008

A countable locally finite triangulation is a strong triangulation if a representation of the graph contains no vertex- or edge-accumulation points. In this paper we exhibit the structure of an infinite strong triangulation and prove the existence of connected spanning subgraph with maximum degree 4 in such a graph

• The Mathematical Education
• /
• 제13권3호
• /
• pp.22-32
• /
• 1975

Matroid와 transversal theory에 관한 연구가 활발하게 진행되고 있다. 이 논문은 circuit matroid가 transversal이 되기 위한 필요 충분 조건을 지적하고 이를 증명한 것이다. 곧 어떤 graph의 circuit matroid가 transversal이 되기 위한 필요 충분 조건은 그 graph가 graph $K_4$거나 $C_{k}$ $^{2}$에 homeomorphic인 subgraph를 포함하지 않은 것이다. 증명의 방법으로는 주로 matroid의 cocircuit의 성질을 사용하여 transversal Matroid의 presentation을 적절하게 적용하고 graph의 reduction과 contraction을 이용한다.

• Journal of information and communication convergence engineering
• /
• 제17권4호
• /
• pp.246-254
• /
• 2019

This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

• The KIPS Transactions:PartA
• /
• 제11A권5호
• /
• pp.341-346
• /
• 2004

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

• The Journal of the Korea Contents Association
• /
• 제19권1호
• /
• pp.141-151
• /
• 2019

A network of graph data structure is used in many applications to represent interactions between entities. Recently, as the size of the network to be processed due to the development of the big data technology is getting larger, it becomes more difficult to handle it in one server, and thus the necessity of distributed processing is also increasing. In this paper, we propose a distributed processing system for efficiently performing subgraph and stores. To reduce unnecessary searches, we use statistical information of the data to determine the search order through probabilistic scoring. Since the relationship between the vertex and the degree of the graph network may show different characteristics depending on the type of data, the search order is determined by calculating a score to reduce unnecessary search through a different scoring method for a graph having various distribution characteristics. The graph is sequentially searched in the distributed servers according to the determined order. In order to demonstrate the superiority of the proposed method, performance comparison with the existing method was performed. As a result, the search time is improved by about 3 ~ 10% compared with the existing method.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.283-291
• /
• 2007

A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.163-166
• /
• 2004

In this paper, we consider the embedding problem of postorder Fibonacci circulants. We show that Fibonacci cubes and Hypercube are a subgraph of postorder Fibonacci circulants. And the postorder Fibonacci circulants of order n can be embedded into the Fibonacci cubes of order n with expansion 1, dilation n-2 and congestion O (n-1), the Hypercube of order n-2 with expansion $\frac{f_n}{2^{n-2}}$, dilation n-2 and congestion O(n-2).

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2006년도 춘계학술발표대회
• /
• pp.743-746
• /
• 2006

In this paper, we propose and analyze a new parallel computer topology, called the Fibonacci posterorder circulants. It connects ${\Large f}_x,\;n{\geq}2$ processing nodes, same the number of nodes used in a comparable Fibonacci cube. Yet its diameter is only ${\lfloor}\frac{n}{3}{\rfloor}$ almost one third that of the Fibonacci cube. Fibonacci cube is asymmetric, but it is a regular and symmetric static interconnection networks for large-scale, loosely coupled systems. It includes scalability and Fibonacci cube as a spanning subgraph.