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

Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
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...
Area Problem01:26

Area Problem

Determining the area of a region with straight edges is straightforward, as geometric formulas for rectangles, triangles, and polygons can be applied directly. However, traditional geometric methods are insufficient when a region has a curved boundary, such as the area under a function.fromThe area problem involves finding a systematic way to measure such regions. One approach to solving this problem is through approximation. Instead of attempting to compute the area exactly at the outset, the...
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in value between...
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,...
Midpoint Rule01:20

Midpoint Rule

Approximating areas under curved boundaries is a common problem in applied mathematics, particularly when an exact calculation is difficult or impractical. One effective numerical method for this purpose is the Midpoint Rule, which provides an estimate of the area under a curve by using rectangular approximations over a specified interval.Description of the Midpoint RuleThe Midpoint Rule begins by dividing the given interval into a number of equal subintervals. For each subinterval, the...

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

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

BMC plant biology·2026
Same author

An optimization framework for hierarchical clustering.

Bioinformatics advances·2026
Same author

Toward identification of common DNA repair process in mutational signatures.

bioRxiv : the preprint server for biology·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

Signing protein-protein interaction networks.

Bioinformatics (Oxford, England)·2025
Same journal

CNV-ECOD: A copy number variation detection method based on ECOD algorithm using next-generation sequencing data.

Journal of bioinformatics and computational biology·2026
Same journal

ReinVar: A model-free paradigm-based reinforcement learning approach to detect copy number variation.

Journal of bioinformatics and computational biology·2026
Same journal

When pipelines run but coordinates fail: A simple spatial specificity check for false locality in post-GWAS analysis.

Journal of bioinformatics and computational biology·2026
Same journal

Comparative benchmarking of template-based, evolutionary-diffusion, and generative language models for IsPETase structure prediction.

Journal of bioinformatics and computational biology·2026
Same journal

Trap spaces as labelled ideals of SCC posets: A structural-functional theory of reachability in asynchronous boolean networks.

Journal of bioinformatics and computational biology·2026
Same journal

Erratum - DDINet: Drug-drug interaction prediction network based on multi-molecular fingerprint features and multi-head attention centered weighted autoencoder.

Journal of bioinformatics and computational biology·2026
See all related articles

Related Experiment Videos

SIGMA: a set-cover-based inexact graph matching algorithm.

Misael Mongiovì1, Raffaele Di Natale, Rosalba Giugno

  • 1Dipartimento di Matematica ed Informatica, Università di Catania, V.le A. Doria, 6, Catania, 95125, Italy. mongiovi@dmi.unict.it

Journal of Bioinformatics and Computational Biology
|April 20, 2010
PubMed
Summary
This summary is machine-generated.

We introduce SIGMA, a novel graph indexing method for inexact network matching. SIGMA significantly improves search performance over existing methods, enabling broader applications in network querying.

Related Experiment Videos

Area of Science:

  • Computer Science
  • Bioinformatics
  • Data Science

Background:

  • Network querying is crucial for applications like drug discovery and comparative genomics.
  • Existing graph indexing methods primarily address exact subgraph matching, limiting their utility.
  • Inexact matching is essential for real-world network analysis where perfect matches are rare.

Purpose of the Study:

  • To develop a novel graph indexing method for efficient inexact network matching.
  • To address the limitations of exact matching in graph querying.
  • To improve the performance and applicability of graph search algorithms.

Main Methods:

  • Developed SIGMA, a graph indexing technique based on approximating a set-cover problem variant.
  • The method handles overlapping multi-sets for robust graph matching.
  • Compared SIGMA against a baseline and the state-of-the-art Grafil.

Main Results:

  • SIGMA demonstrates superior performance compared to baseline and Grafil methods.
  • The proposed method achieves higher pruning power across all tested scenarios.
  • This indicates enhanced efficiency for large-scale graph database searches.

Conclusions:

  • SIGMA offers a powerful solution for inexact graph matching problems.
  • The method significantly advances network querying capabilities.
  • SIGMA's improved performance opens new avenues for applications in various scientific domains.