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 Concept Videos

Protein Networks02:26

Protein Networks

4.7K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.7K

You might also read

Related Articles

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

Sort by
Same author

The Brazilian developments on the Regional Atmospheric Modeling System (BRAMS 5.2): an integrated environmental model tuned for tropical areas.

Geoscientific model development·2020
See all related articles

Related Experiment Video

Updated: Apr 4, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.7K

acc-Motif: Accelerated Network Motif Detection.

Luis A A Meira, Vinícius R Máximo, Álvaro L Fazenda

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |September 11, 2015
    PubMed
    Summary

    This study introduces a novel algorithm for network motif detection, significantly accelerating subgraph counting. The new method demonstrates superior performance compared to existing tools like Kavosh and FANMOD.

    More Related Videos

    Peptide-based Identification of Functional Motifs and their Binding Partners
    14:28

    Peptide-based Identification of Functional Motifs and their Binding Partners

    Published on: June 30, 2013

    13.1K
    Quantification of Protein Interaction Network Dynamics using Multiplexed Co-Immunoprecipitation
    07:57

    Quantification of Protein Interaction Network Dynamics using Multiplexed Co-Immunoprecipitation

    Published on: August 21, 2019

    9.4K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
    10:44

    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

    Published on: December 7, 2021

    2.7K
    Peptide-based Identification of Functional Motifs and their Binding Partners
    14:28

    Peptide-based Identification of Functional Motifs and their Binding Partners

    Published on: June 30, 2013

    13.1K
    Quantification of Protein Interaction Network Dynamics using Multiplexed Co-Immunoprecipitation
    07:57

    Quantification of Protein Interaction Network Dynamics using Multiplexed Co-Immunoprecipitation

    Published on: August 21, 2019

    9.4K

    Area of Science:

    • Computational Biology
    • Network Science
    • Bioinformatics

    Background:

    • Network motifs are fundamental building blocks of complex networks, particularly in gene regulation.
    • Motif detection algorithms are crucial for understanding biological network organization.
    • Existing methods for induced subgraph counting can be computationally intensive.

    Purpose of the Study:

    • To propose an efficient algorithm for counting network motifs.
    • To enhance the speed of motif detection in directed graphs.
    • To compare the performance of the new algorithm against established tools.

    Main Methods:

    • Developed an algorithm to count induced subgraphs of size k+2 based on those of size k.
    • Applied the technique to detect 3, 4, and 5-sized motifs in directed graphs.
    • Analyzed time complexity as O(a(G)m), O(m(2)), and O(nm(2)) for different motif sizes.

    Main Results:

    • The proposed algorithm achieved one order of magnitude speed improvement over Kavosh and FANMOD.
    • Computational experiments on public datasets confirmed the efficiency of the new technique.
    • The acc-Motif algorithm showed slightly improved performance compared to NetMODE.

    Conclusions:

    • The novel algorithm offers a significant speedup for network motif discovery.
    • This advancement facilitates the analysis of larger and more complex biological networks.
    • The proposed method represents an improvement in computational efficiency for motif detection.