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

Trigonometric Substitution01:23

Trigonometric Substitution

98
Trigonometric substitution is a technique used to simplify integrals that contain square root expressions involving quadratic forms. It is particularly effective when the integrand includes terms resembling those found in standard geometric equations, such as circles or ellipses.Molniya satellites follow highly elliptical orbits, repeatedly sweeping out the same regions of space as they revolve around Earth. To estimate the area enclosed by such an orbit, the path is modeled as an ellipse...
98
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

316
The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...
316
Lattice Centering and Coordination Number02:33

Lattice Centering and Coordination Number

13.8K
The structure of a crystalline solid, whether a metal or not, is best described by considering its simplest repeating unit, which is referred to as its unit cell. The unit cell consists of lattice points that represent the locations of atoms or ions. The entire structure then consists of this unit cell repeating in three dimensions. The three different types of unit cells present in the cubic lattice are illustrated in Figure 1.
Types of Unit Cells
Imagine taking a large number of identical...
13.8K
Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

6.0K
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
6.0K
Combinatorial Gene Control02:33

Combinatorial Gene Control

9.8K
Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
9.8K
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

514
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
514

You might also read

Related Articles

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

Sort by
Same author

Hands-on training about data clustering with orange data mining toolbox.

PLoS computational biology·2024
Same author

Seroprevalence of severe acute respiratory syndrome coronavirus 2 in Slovenia: results of two rounds of a nationwide population study on a probability-based sample, challenges and lessons learned.

Clinical microbiology and infection : the official publication of the European Society of Clinical Microbiology and Infectious Diseases·2021
Same author

Hands-on training about overfitting.

PLoS computational biology·2021
Same author

Democratized image analytics by visual programming through integration of deep models and small-scale machine learning.

Nature communications·2019
Same author

scOrange-a tool for hands-on training of concepts from single-cell data analytics.

Bioinformatics (Oxford, England)·2019
Same author

Assessment of machine learning reliability methods for quantifying the applicability domain of QSAR regression models.

Journal of chemical information and modeling·2014
Same journal

Thymidylate synthase inhibitory drugs induce p53-dependent pathways differently.

PloS one·2026
Same journal

Top-down and bottom-up attention for joint pattern classification and reconstruction.

PloS one·2026
Same journal

Short- and long-term scaling behavior of blood pressure and pulse arrival time during sleep in healthy controls and patients with obstructive sleep apnea.

PloS one·2026
Same journal

Double DQN-based secrecy energy efficiency and fairness performance in IRS-assisted NOMA systems with friendly jamming.

PloS one·2026
Same journal

10 recommendations for strengthening citizen science for improved societal and ecological outcomes: A co-produced analysis of challenges and opportunities in the 21st century.

PloS one·2026
Same journal

Paying in public: Peer effects, impression management, and willingness to pay on digital payment platforms.

PloS one·2026
See all related articles

Related Experiment Video

Updated: Mar 7, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.6K

Combinatorial algorithm for counting small induced graphs and orbits.

Tomaž Hočevar1, Janez Demšar1

  • 1Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia.

Plos One
|February 10, 2017
PubMed
Summary
This summary is machine-generated.

This study introduces a faster graphlet counting algorithm for bioinformatics using linear equations, improving upon existing methods for network analysis.

More Related Videos

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
Analyzing the Size, Shape, and Directionality of Networks of Coupled Astrocytes
10:10

Analyzing the Size, Shape, and Directionality of Networks of Coupled Astrocytes

Published on: October 4, 2018

9.4K

Related Experiment Videos

Last Updated: Mar 7, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.6K
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
Analyzing the Size, Shape, and Directionality of Networks of Coupled Astrocytes
10:10

Analyzing the Size, Shape, and Directionality of Networks of Coupled Astrocytes

Published on: October 4, 2018

9.4K

Area of Science:

  • Bioinformatics
  • Network Analysis
  • Computational Biology

Background:

  • Graphlet analysis is a key network analysis technique in bioinformatics.
  • Current methods for counting graphlets, especially larger ones, can be computationally intensive.
  • Faster algorithms are needed to analyze complex biological networks.

Purpose of the Study:

  • To develop a significantly faster algorithm for graphlet counting.
  • To generalize existing efficient methods for counting graphlets of various sizes.
  • To provide a novel approach for network analysis in bioinformatics.

Main Methods:

  • Setting up a system of linear equations relating graphlet orbit counts.
  • Developing a new algorithm based on these linear equations.
  • Generalizing the approach for arbitrary graphlet sizes, with exceptions for complete graphs and 4-node cycles.

Main Results:

  • The proposed algorithm is significantly faster than existing direct enumeration methods.
  • The method is a generalization of the fastest known algorithm for 5-node graphlets.
  • Theoretical results on vertex properties for arbitrary graph sizes are confirmed.
  • Empirical analysis validates the theoretical running time improvements.

Conclusions:

  • The new algorithm offers a substantial speedup for graphlet counting in bioinformatics.
  • This approach provides a more efficient tool for network analysis of biological data.
  • The method is broadly applicable, with specific handling for certain graph structures.