NDLI: Efficient Detection of Network Motifs

Please wait, while we are loading the content...

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 13

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 12

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 11

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 10

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 9

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 8

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 7

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 6

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 5

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 4

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 3

Issue 4, October 2006

Guest Editor's Introduction to the Special Issue on Computational Biology and Bioinformatics -- Part 1

Using Max Cut to Enhance Rooted Trees Consistency

Pattern Identification in Biogeography

Efficient Detection of Network Motifs

Motif Search in Graphs: Application to Metabolic Networks

A 1.375-Approximation Algorithm for Sorting by Transpositions

New Bounds and Tractable Instances for the Transposition Distance

Comparing Tandem Repeats with Duplications and Excisions of Variable Degree

Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

Annual Index

Issue 3, July 2006

Issue 2, April 2006

Issue 1, January 2006

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 2

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) : Volume 1

Efficient Detection of Network Motifs

Content Provider	ACM Digital Library
Author	Wernicke, Sebastian
Abstract	Motifs in a given network are small connected subnetworks that occur in significantly higher frequencies than would be expected in random networks. They have recently gathered much attention as a concept to uncover structural design principles of complex networks. Kashtan et al. [Bioinformatics, 2004] proposed a sampling algorithm for performing the computationally challenging task of detecting network motifs. However, among other drawbacks, this algorithm suffers from a sampling bias and scales poorly with increasing subgraph size. Based on a detailed analysis of the previous algorithm, we present a new algorithm for network motif detection which overcomes these drawbacks. Furthermore, we present an efficient new approach for estimating the frequency of subgraphs in random networks that, in contrast to previous approaches, does not require the explicit generation of random networks. Experiments on a testbed of biological networks show our new algorithms to be orders of magnitude faster than previous approaches, allowing for the detection of larger motifs in bigger networks than previously possible and thus facilitating deeper insight into the field.
Starting Page	347
Ending Page	359
Page Count	13
File Format	PDF
ISSN	15455963
DOI	10.1109/TCBB.2006.51
Volume Number	3
Issue Number	4
Journal	IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-10-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Network motif detection algorithm, subgraph enumeration, subgraph sampling, subgraph concentration in random graphs.
Content Type	Text
Resource Type	Article
Subject	Genetics Biotechnology Applied Mathematics

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

Efficient Detection of Network Motifs

Acc-Motif: accelerated network motif detection

acc-Motif: Accelerated Network Motif Detection

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs (2004)

Symmetry Compression Method for Discovering Network Motifs

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs (2004)

Symmetry Compression Method for Discovering Network Motifs

Motif Search in Graphs: Application to Metabolic Networks

Efficiently Estimating Motif Statistics of Large Networks

Efficient Detection of Network Motifs

Similar Documents

Efficient Detection of Network Motifs

Acc-Motif: accelerated network motif detection

acc-Motif: Accelerated Network Motif Detection

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs (2004)

Symmetry Compression Method for Discovering Network Motifs

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs (2004)

Symmetry Compression Method for Discovering Network Motifs

Motif Search in Graphs: Application to Metabolic Networks

Efficiently Estimating Motif Statistics of Large Networks

Efficient Detection of Network Motifs