Jove
Visualize
Contact Us

Related Experiment Videos

Efficient detection of network motifs.

Sebastian Wernicke1

  • 1Institut für Informatik, Friedrich-Shiller-Universität Jena, Jena, Germany. wernicke@minet.uni-jena.de

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|November 7, 2006
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

Methods in molecular biology (Clifton, N.J.)·2016
Same author

Developing fixed-parameter algorithms to solve combinatorially explosive biological problems.

Methods in molecular biology (Clifton, N.J.)·2008
Same author

Simple and fast alignment of metabolic pathways by exploiting local diversity.

Bioinformatics (Oxford, England)·2007
Same author

Faspad: fast signaling pathway detection.

Bioinformatics (Oxford, England)·2007
Same author

FANMOD: a tool for fast network motif detection.

Bioinformatics (Oxford, England)·2006
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

We developed a faster algorithm for detecting network motifs, which are key subnetworks in complex systems. This new method improves upon previous techniques, enabling deeper analysis of biological networks.

Area of Science:

  • Computational biology
  • Network science
  • Systems biology

Background:

  • Network motifs are recurring subnetworks with significant biological functions.
  • Identifying network motifs is crucial for understanding complex network structures.
  • Previous algorithms for network motif detection have limitations, including sampling bias and poor scalability.

Purpose of the Study:

  • To develop a novel, efficient algorithm for detecting network motifs.
  • To improve upon existing methods by addressing sampling bias and scalability issues.
  • To introduce a new approach for estimating subgraph frequencies in random networks without explicit generation.

Main Methods:

  • Analysis of a previously proposed network motif detection algorithm.
  • Development of a new sampling algorithm to overcome drawbacks of existing methods.

Related Experiment Videos

  • Implementation of an efficient subgraph frequency estimation technique for random networks.

    • Main Results:

    • The new algorithm demonstrates significantly improved speed, orders of magnitude faster than previous approaches.
    • The enhanced method allows for the detection of larger motifs in larger networks.
    • The new subgraph frequency estimation method avoids the need for generating random networks.

    Conclusions:

    • The developed algorithm offers a more efficient and scalable solution for network motif detection.
    • This advancement facilitates deeper insights into the structural design principles of complex biological networks.
    • The findings pave the way for analyzing larger and more complex network datasets.