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

Graphical Representation of Inequalities01:28

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...
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
Graphs of Two-Variable Functions01:27

Graphs of Two-Variable Functions

A weather map provides a practical example of a function of two variables. Across a wide region such as the United States, temperatures vary from one location to another. Each location can be identified by two geographic coordinates: longitude and latitude. Since a single temperature value is assigned to each coordinate pair, the situation can be represented mathematically as a function with two inputs and one output.In mathematical notation, longitude and latitude can be labeled as x and y,...
Graphs of Functions01:30

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...
Graphs of Polar Equations01:17

Graphs of Polar Equations

The polar coordinate system represents points using a distance from a central point (the pole) and an angle from a reference direction (the polar axis). Unlike rectangular coordinates, polar coordinates are ideal for graphing curves with radial symmetry or periodic behavior.Some general forms of graphs in polar coordinates include the following:Equation of a Circle (Centered at the Pole):A graph where the radius remains constant for all angles traces a circle centered at the pole:Equation of a...
Vector Algebra: Graphical Method01:10

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

You might also read

Related Articles

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

Sort by
Same author

Developmental manganese exposure, but not concurrent lead, alters social processing selectively in male mice.

iScience·2026
Same author

Uncovering the metabolomic signatures in adolescent depression using a targeted metabolomics approach.

BMC psychiatry·2026
Same author

Exogenous microbial consortia modulate rhizosphere microbiome and yield of grafted tomato grown in the mediterranean greenhouse.

BMC plant biology·2026
Same author

Hi-C for genome-wide detection of enhancer-hijacking rearrangements in routine lymphoid cancer biopsies.

Cell genomics·2026
Same author

An open-source clinical bioinformatics pipeline for real-world NGS implementation: translating genomic variants into actionable treatment strategies in oncology.

Journal of translational medicine·2026
Same author

CRISPR-HAWK: Haplotype- and Variant-aware guide design toolkit for CRISPR-Cas.

bioRxiv : the preprint server for biology·2026
Same journal

Research on multi-trait genome association study method based on Shannon information entropy.

BMC bioinformatics·2026
Same journal

A multi-view feature fusion framework with interpretable graph convolution for predicting microbe-drug associations.

BMC bioinformatics·2026
Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026
Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jun 16, 2026

Novel Sequence Discovery by Subtractive Genomics
09:40

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

SING: subgraph search in non-homogeneous graphs.

Raffaele Di Natale1, Alfredo Ferro, Rosalba Giugno

  • 1Dipartimento di Matematica ed Informatica, Università di Catania, Catania, Italy.

BMC Bioinformatics
|February 23, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces SING, a novel indexing system for subgraph isomorphism search in large graph databases. SING improves filtering and speeds up searches by utilizing feature locality, outperforming existing methods on large datasets.

Related Experiment Videos

Last Updated: Jun 16, 2026

Novel Sequence Discovery by Subtractive Genomics
09:40

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

Area of Science:

  • Graph theory
  • Database systems
  • Computational complexity

Background:

  • Subgraph isomorphism is crucial for applications like cheminformatics and image analysis.
  • Existing indexing methods struggle with large graphs due to diminishing filtering power.
  • Efficiently searching large graph databases remains a significant computational challenge.

Purpose of the Study:

  • To present SING (Subgraph search In Non-homogeneous Graphs), a new indexing system designed for large graph databases.
  • To enhance the efficiency of subgraph isomorphism detection in large-scale graph data.
  • To address the limitations of current indexing techniques in handling large graphs.

Main Methods:

  • SING utilizes a feature-based indexing approach, where features can be subgraphs, subtrees, or paths.
  • Graphs in the database are annotated with their respective features.
  • The system leverages feature locality information to optimize filtering and search performance.

Main Results:

  • SING demonstrates superior query performance compared to popular systems on medium and large graph databases.
  • The system effectively handles subgraph isomorphism searches within single large graphs.
  • Improved filtering power and faster subgraph isomorphism task execution were observed.

Conclusions:

  • SING offers a scalable and efficient solution for subgraph isomorphism search in large graph databases.
  • The feature locality approach in SING significantly enhances performance over existing methods.
  • The system proves effective for both database-wide and single-graph analyses.