In this paper, we have tried to implement a subgraph discovery method. Unlike other frequent subgraph mining methods, here we are trying to find only those subgraphs that are associated with a specific set of vertices which are biologically relevant, suggested by experts in Biotechnology, Bioinformatics, Plant System Biology etc,. Parallel processing would be an excellent solution for generating candidate subgraphs and would likely speed-up the code a great deal. So it will become necessary to work with a Breadth First Search approach (BFS) instead of a Depth First Search approach (DFS) to optimise the usage of parallel computing. Hence, traversing through the search space has been completed in a BFS manner so that we can implement parallel processing in future. Demonstration of this method is done on two biological data sets and shown that we can find associated subgraphs for the biologically relevant set of vertices.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Associated subgraph mining in biological network


    Contributors:


    Publication date :

    2017-04-01


    Size :

    304685 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Traffic Status Prediction and Analysis Based on Mining Frequent Subgraph Patterns

    Xu, Gang ;Jin, Hai He ;Liu, Jing | Trans Tech Publications | 2012



    The Maximum Degree & Diameter-Bounded Subgraph and its Applications

    Dekker, A. / Pérez-Rosés, H. / Pineda-Villavicencio, G. et al. | British Library Online Contents | 2012



    Subgraph matching algorithm based on graduated nonconvexity and concavity procedure

    Li, Jing / Liu, Chuankai / Wang, Yong et al. | British Library Online Contents | 2015