Jove
Visualize
Contact Us
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

Related Experiment Videos

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs.

N Kashtan1, S Itzkovitz, R Milo

  • 1Department of Molecular Cell biology, Weizmann Institute of Science, Rehovot 76100, Israel.

Bioinformatics (Oxford, England)
|March 6, 2004
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

EAN guideline on palliative care of people with severe, progressive multiple sclerosis.

European journal of neurology·2020
Same author

Patient and caregiver involvement in the formulation of guideline questions: findings from the European Academy of Neurology guideline on palliative care of people with severe multiple sclerosis.

European journal of neurology·2018
Same author

Parinaud syndrome: Any clinicoradiological correlation?

Acta neurologica Scandinavica·2017
Same author

Daclizumab and its use in multiple sclerosis treatment.

Drugs of today (Barcelona, Spain : 1998)·2017
Same author

Evaluation of the national tuberculosis surveillance program in Haiti.

The international journal of tuberculosis and lung disease : the official journal of the International Union against Tuberculosis and Lung Disease·2015
Same author

Stroke in the very elderly: characteristics and outcome in patients aged ≥85 years with a first-ever ischemic stroke.

Neuroepidemiology·2012
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
See all related articles

Researchers developed a new algorithm for detecting network motifs, which are common patterns in biological networks. This method uses random sampling for faster analysis, enabling the study of larger and more complex networks than previously possible.

Area of Science:

  • Systems biology
  • Network science
  • Computational biology

Background:

  • Biological and engineered networks exhibit characteristic patterns called network motifs.
  • These motifs occur more frequently than in randomized networks and play crucial roles in biological regulation.
  • Previous algorithms for motif detection relied on exhaustive subgraph enumeration, limiting scalability with network size.

Purpose of the Study:

  • To develop a novel algorithm for efficient estimation of subgraph concentrations and detection of network motifs.
  • To overcome the runtime limitations of existing exhaustive enumeration methods.
  • To enable the analysis of larger networks and higher-order motifs.

Main Methods:

  • A novel algorithm based on random sampling of subgraphs.

Related Experiment Videos

  • Estimation of subgraph concentrations and detection of network motifs.
  • Asymptotically independent runtime from network size.

    • Main Results:

    • The algorithm accurately detects network motifs with a small number of samples across various networks.
    • It allows for the estimation of concentrations for larger subgraphs in larger networks.
    • Demonstrated application to high-order motifs in biological networks.

    Conclusions:

    • The novel random sampling algorithm provides a scalable and efficient method for network motif detection.
    • This approach significantly expands the scope of network motif analysis in biological systems.
    • The findings facilitate deeper understanding of information processing in complex networks.