Browsing by Author "Sumathi P"

Now showing 1 - 8 of 8

EFFICIENTLY MINING CLOSED SEQUENCE PATTERNS IN DNA WITHOUT CANDIDATE GENERTION
(International Journal Life Science Pharmacology Research, 2020) Jawahar S; Harishchander A; Devaraju S; Reshmi S; Manivasagan C; Sumathi P
Sequential pattern mining is a technique which efficiently determines the frequent patterns from small datasets. The traditional sequential pattern mining algorithms can mine short-term sequences efficiently, but mining long sequence patterns are in efficient for these algorithms. The traditional mining algorithms use candidate generation method which leads to more search space and greater running time. The biological DNA sequences have long sequences with small alphabets. These biological data can be mined for finding the co-occurring biological sequence. These co-occurring sequences are important for biological data analysis and data mining. Closed sequential pattern mining is used for mining long sequences. The mined patterns have less number of closed sequences. This paper proposes an efficient Closed Sequential Pattern Mining without Candidate Generation (CSPMCG) algorithm for efficiently mining closed sequential patterns. The CSPMCG algorithm mines closed patterns without candidate generation. This algorithm uses two pruning methods namely, BackScan pruning, and frequent occurrence check methods. The former method prunes the search space and latter detects the closed sequential pattern in early run time. The proposed algorithm is compared with PrefixSpan and SPADE algorithms, better scalability and interpretability is achieved for proposed algorithm. The experimental results are based on sample DNA datasets which outperform the other algorithms in efficiency, memory and running time.
GENERALIZED 2-COMPLEMENT OF SET DOMINATION
(International journal of Scientific & Technology research volume 4, Issue 12, 2015-12) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph and P= (V1,V2,….., VK) be a partition of V of order k>1.The k-complement Gk p of G (with respect to P) is defined as follows: For all Vi and Vj in P ij remove the edges between Vi and Vj in G and join the edges between Vi and Vj which are not in G. The graph thus obtained is called the kcomplement of G with respect to P. In this paper 2- complement is considered. Let G=(V,E) be a connected graph. A set SV is a set dominating set if for every set TV-S , there exists a non-empty set RS such that the subgraph is connected. The minimum cardinality of a set dominating set is called set domination number and it is denoted by γs (G). In the following example the set domination number γs is calculated..
GENERALIZED 3 – COMPLEMENT OF SET DOMINATION
(The International Journal of Science & Technoledge, 2015-10) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph. A set S⊆V of vertices of a graph G = (V, E) is called a dominating set if every vertex v∈V is either an element of S or is adjacent to an element of S. A set S⊆V is a set dominating set if for every set T⊆V-S, there exists a non-empty set R⊆S such that the subgraph is connected. The minimum cardinality of a set dominating set is called set domination number and it is denoted by γs (G).Let P=(V1,V2,V3) be a partition of V of order 3. Remove the edges between Vi and Vj where i≠j (1≤i,j≤3) in G and join the edges between Vi and Vjwhich are not in G. The graph G3p thus obtained is called 3-complement of G with respect to ‘P’.
GENERALIZED 3-COMPLEMENT OF SET DOMINATION
(The International Journal of Science &Technoledge voll.3,Issue10, 2015-10) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph. A set SÍV of vertices of a graph G = (V, E) is called a dominating set if every vertex vÎV is either an element of S or is adjacent to an element of S. A set SÍV is a set dominating set if for every set TÍV-S, there exists a non-empty set RÍS such that the subgraph is connected. The minimum cardinality of a set dominating set is called set domination number and it is denoted by γs (G).Let P=(V1,V2,V3) be a partition of V of order 3. Remove the edges between Vi and Vj where i¹j (1£i,j£3) in G and join the edges between Vi and Vj which are not in G. The graph G3p thus obtained is called 3-complement of G with respect to ‘P’.
A NOTE ON NON-SPLIT SET DOMINATION
(International Journal of Software & Hardware Research in Engineering, 2016-01) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph. A non empty set SV of vertices in a graph G is called a dominating set if every vertex in V-S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum cardinality of a dominating set of G.A dominating set S is called a non split set dominating set if there exists a non empty set R S such that is connected for every set TV-S and the induced subgraph is connected. The minimum cardinality of a nonsplit set dominating set is called the non split set domination number of G and is denoted by γnss (G). In this paper, bounds for γnss (G) and exact values for some particular classes of graphs are found. Keywords: Dominating Number, Non Split domination number
A NOTE ON SPLIT SET DOMINATION
(International Journal of Engineering Technology and Management, 2016-02) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph. A non empty set S of V of vertices in a graph G is calleda dominating set if every vertex in V-S is adjacent to some vertex in S. The domination number γ(G) is theminimum cardinality of a dominating set of G.A dominating set S is called a non split set dominatingset if thereexists a non empty set R of S such that is connected for every set T of V-Sand the induced subgraphis not connected. The minimum cardinality of a split set dominating set is called the split set domination numberof G and is denoted by γss(G). In this paper, bounds for γss(G) andvalues for some particular classes of graphs are found and also the split set domination number of some standard graphs is given in this paper
REGULAR PANCYCLIC GRAPHS OF SET DOMINATION AND TOTAL SET DOMINATION
(Journal of Adv Research in Dynamical & Control Systems, 2017) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph. A dominating set S is a set dominating set of G if for every set T⊆V-S, there exists a non-empty set R⊆S such that the subgraph is connected. A dominating set S is called a total set dominating set if the following conditions hold: (i) every vertex of V(G) is adjacent to some vertex in S (ii) for every set T⊆V-S there exists a non-empty set R⊆S such that the subgraph is connected. In this paper, we establish that for all n≥3 there exists a k-regular pancyclic graph G with n vertices and γs(G)= γts(G) where both n and k are even and 6≤k≤n-1. And, there exists a k-regular pancyclic graph G with n vertices and γs(G)= γts(G) where n is even and k is odd and 5≤k≤n-1. Also, we establish that, there exists a n-regular (n=3,4) graph G with the property that γs(G)= γts(G
SET DOMINATION MAXSUBDIVISION NUMBER OF GRAPHS
(International Journal of Software & Hardware Research in Engineering, 2016-01-01) Sumathi P; Brindha T
Let G=(V,E) be a simple, undirected, finite nontrivial graph. A non empty set SV of vertices in a graph G is called a dominating set if every vertex in V-S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G.A dominating set S is a set dominating set of G if for every set TV-S , there exists a non-empty set RS such that the subgraph is connected. The set domination number of G is the minimum cardinality of a set dominating set of G and it is denoted by γs (G).The set domination maxsubdivision number of G is the maximum number of edges that must be subdivided (where each edge in G can be subdivided atmost once) in order to increase the set domination number and is denoted by msdγs(G). In this paper, we establish the properties and exact values of the set domination maxsubdivision number for some families of graphs.