NDLI: Iterative Hadoop MapReduce-Based Subgraph Enumeration in Network Motif Analysis

Content Provider	IEEE Xplore Digital Library
Author	Verma, V. Kwon, P.P. Wooyoung Kim
Copyright Year	2015
Description	Author affiliation: Sch. of Sci., Technol., Eng., & Math., Univ. of Washington - Bothell, Bothell, WA, USA (Verma, V.; Kwon, P.P.; Wooyoung Kim)
Abstract	Finding network motifs in biological networks is a computationally intensive task as it involves traversing through a large network to enumerate all possible sub graphs of a given size, and then determining their statistical uniqueness by sampling sub graphs from a large number (more than 1,000) of random graph pools. There have been parallelization efforts in the past to mitigate the computational intensity for finding network motifs. However, they are either more for the frequent sub graphs in networks rather than network motifs, or require complex manipulations on message passing or designs. Additionally, most of the parallel algorithms are unavailable as tools for use. In this paper, we introduce a project of 'complete network motif parallelization.' This project aims to improve performance of serial algorithms for finding sub graphs in PPI networks - ESU algorithm and McKay's canonical labeling algorithm - by parallel zing them using iterative Hadoop MapReduce on Google Cloud, and then determining their uniqueness through explicit or direct random graph generation. In this paper, we describe the parallelization of ESU and McKay's canonical algorithms and present the experimental results with a significant improvement in performance, up to 37 times speedup. We are continuing to parallelize network motif significance as a next step, and expecting the completion of the project in near future.
Starting Page	893
Ending Page	900
File Size	1096556
Page Count	8
File Format	PDF
ISSN	21596190
e-ISBN	9781467372879
DOI	10.1109/CLOUD.2015.122
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-27
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Network Motifs Cloud MapReduce
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Network Motif Analysis in Clouds-Subgraph Enumeration with Iterative Hadoop MapReduce

An iterative MapReduce approach to frequent subgraph mining in biological datasets

SAHAD: Subgraph Analysis in Massive Networks Using Hadoop

Efficient Detection of Network Motifs

Complete enumeration of compact structural motifs in proteins

A comparative analysis of iterative MapReduce systems

Network motif discovery using subgraph enumeration and symmetry-breaking (2007)

Evaluation of subgraph searching algorithms detecting network motif in biological networks

Network motif discovery using subgraph enumeration and symmetry-breaking (2007)

Iterative Hadoop MapReduce-Based Subgraph Enumeration in Network Motif Analysis

Similar Documents

Network Motif Analysis in Clouds-Subgraph Enumeration with Iterative Hadoop MapReduce

An iterative MapReduce approach to frequent subgraph mining in biological datasets

SAHAD: Subgraph Analysis in Massive Networks Using Hadoop

Efficient Detection of Network Motifs

Complete enumeration of compact structural motifs in proteins

A comparative analysis of iterative MapReduce systems

Network motif discovery using subgraph enumeration and symmetry-breaking (2007)

Evaluation of subgraph searching algorithms detecting network motif in biological networks

Network motif discovery using subgraph enumeration and symmetry-breaking (2007)

Iterative Hadoop MapReduce-Based Subgraph Enumeration in Network Motif Analysis