Paper Info
Title
Mining Maximal Frequent Subgraphs in KEGG Reaction Networks
Abstract
In this paper we employ a recent algorithm by Zantema et al. for detecting maximal frequent subgraphs (MFS) in collections of graphs corresponding tobiological networks from the KEGG database. Each graph of a particular collection corresponds to one organism and represents one pathway or a union of pathways of this organism. Previously the MFS algorithm has been applied only to graphs that have enzymes as nodes. In this paper we introduce a new type of graphs, reaction graphs, which contain more information than the enzyme graphs. We apply the MFS algorithm to reaction graphs obtained from the KEGG network. Earlier the MFS algorithm was tested only on smaller graphs of individual metabolic pathways. In this paper we show that the algorithm can cope with large collections (containing more than 600 graphs) of large graphs (comprising more than 5000 edges). Moreover, the results are produced in real time - within a few seconds - which is important for on-line applications of thealgorithm. Also, our results confirm the the feasibility of the maximal frequent subgraphs approach for finding similarities and relationships between different organisms -the more similar the graphs in the collection, the larger the size of the found maximal frequent subgraphs.
Year
DOI
Venue
2009
10.1109/DEXA.2009.66
DEXA Workshops
Keywords
Field
DocType
graphs corresponding tobiological network,kegg network,maximal frequent subgraphs,different organism,mfs algorithm,kegg reaction networks,large collection,reaction graph,mining maximal frequent subgraphs,maximal frequent subgraphs approach,recent algorithm,kegg database,graph theory,metabolic pathway,data mining,real time,enzyme,microorganisms,biochemistry
Graph theory,Data mining,Indifference graph,Modular decomposition,Computer science,Chordal graph,Clique-sum,KEGG,Pathwidth,Database,Maximal independent set
Conference
Citations 
PageRank 
References 
0
0.34
7
Authors
3
Name
Order
Citations
PageRank
Willem P. A. Ligtenberg1101.16
Dragan Bosnacki227626.95
Peter A. J. Hilbers310012.73