Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Graphical Representation of Inequalities

Graphical Representation of Inequalities

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 points...

Multiple Bar Graph

Multiple Bar Graph

As the name suggests, a multiple bar graph is the same as a bar graph but has multiple bars to depict relationships between different data values. One can include as many parameters as possible. However, each parameter must have the same unit of measurement.
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...

Graphs of Functions

Graphs of Functions

Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...

Time-Series Graph

Time-Series Graph

A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...

Relative Frequency Histogram

Relative Frequency Histogram

The relative frequency depicts the proportion of data points that have each value. The frequency tells the number of data points that have each value. Like the histogram, a relative frequency histogram also has the same shape with a horizontal scale (the x-axis), but the vertical scale (the y-axis) is marked with relative frequencies (percentages of the whole) instead of actual frequencies. A relative frequency histogram is a graphical representation of a frequency distribution where the...

You might also read

Related Articles

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

Sort by

Same author

Comparison of the Effects of Norepinephrine and Phenylephrine Infusion in Preventing Hypotension during Spinal Anesthesia for Cesarean Delivery: A Randomized, Double-Blind Clinical Trial.

Archives of Iranian medicine·2025

Same author

Disease candidate genes prediction using positive labeled and unlabeled instances.

BMC medical genomics·2025

Same author

Comparison of Anesthesia Results between Wide Awake Local Anesthesia no Tourniquet (WALANT) and Forearm Tourniquet Bier Block in Hand Surgeries: A Randomized Clinical Trial.

The archives of bone and joint surgery·2021

Same author

DPCT: A Dynamic Method for Detecting Protein Complexes From TAP-Aware Weighted PPI Network.

Frontiers in genetics·2020

Same author

Comparison of effects of propofol and ketofol (Ketamine-Propofol mixture) on emergence agitation in children undergoing tonsillectomy.

African health sciences·2019

Same author

C-PUGP: A cluster-based positive unlabeled learning method for disease gene prediction and prioritization.

Computational biology and chemistry·2018

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

Search research articles

Related Experiment Video

Updated: May 9, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

RANGI: a fast list-colored graph motif finding algorithm.

Ali Gholami Rudi¹, Saeed Shahrivari, Saeed Jalili

¹Faculty of Electrical and Computer Engineering, Tarbiat Modares University, Tehran, Iran, PO Box 14115-194, Tehran, Iran. gholamirudi@modares.ac.ir

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|August 10, 2013

Summary

This summary is machine-generated.

Researchers developed RANGI, a fast algorithm for finding graph motifs in biological networks. This new method efficiently identifies functional patterns within complex network data.

More Related Videos

Rapid Analysis and Exploration of Fluorescence Microscopy Images

Rapid Analysis and Exploration of Fluorescence Microscopy Images

Published on: March 19, 2014

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

Related Experiment Videos

Last Updated: May 9, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

Rapid Analysis and Exploration of Fluorescence Microscopy Images

Rapid Analysis and Exploration of Fluorescence Microscopy Images

Published on: March 19, 2014

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

Area of Science:

Computational biology
Graph theory
Algorithm design

Background:

The list-colored graph motif problem is crucial for identifying functional patterns in biological networks.
This NP-hard problem involves finding the largest connected subgraph meeting specific color criteria.

Purpose of the Study:

To introduce RANGI, a novel branch-and-bound algorithm for finding and enumerating list-colored graph motifs.
To address the computational challenges of identifying functional motifs in biological networks.

Main Methods:

Developed a branch-and-bound algorithm named RANGI.
Implemented advanced pruning methods and heuristics for efficiency.
Created a parallel version of RANGI to enhance scalability.

Main Results:

RANGI demonstrates significant speed improvements over existing algorithms.
The algorithm effectively finds and enumerates list-colored graph motifs.
The parallel version shows acceptable scalability for larger datasets.

Conclusions:

RANGI offers a computationally efficient solution for the list-colored graph motif problem.
The algorithm is practical for identifying functional motifs in biological networks.
Parallelization enhances RANGI's applicability to large-scale network analysis.