This paper presents some graph-mining algorithms and their application in genetic regulatory networks. We use item set labeling method of directed graphs, to efficiently find frequent subgraphs. An inexact match scheme of subgraphs is performed by an edit distance of vertices and directed edges in the Regulatory Networks. This inexact frequent subgraph algorithm extends the paper of Koyuturk, Grama and Szpankowski on exact frequent subgraphs (The Kayuturk et al paper considers the inexact match as an open problem).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.