Jove
Visualize
Contact Us

Related Concept Videos

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 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 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...
Ogive Graph01:07

Ogive Graph

An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this type...
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...
SFG Algebra01:16

SFG Algebra

In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...

You might also read

Related Articles

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

Sort by
Same author

Biomine: predicting links between biological entities using network models of heterogeneous databases.

BMC bioinformatics·2012
Same author

Constrained hidden Markov models for population-based haplotyping.

BMC bioinformatics·2007
Same author

HaploRec: efficient and accurate large-scale reconstruction of haplotypes.

BMC bioinformatics·2006
Same author

TreeDT: tree pattern mining for gene mapping.

IEEE/ACM transactions on computational biology and bioinformatics·2006
Same author

Haplotype associations define target regions for susceptibility loci in systemic lupus erythematosus.

European journal of human genetics : EJHG·2004
Same author

Physical map of an asthma susceptibility locus in 7p15-p14 and an association study of TCRG.

European journal of human genetics : EJHG·2002
Same journal

Updates and validation of the Compi RNA-seq pipeline with a case study in Alzheimer's disease.

Journal of integrative bioinformatics·2026
Same journal

Fragment-level FAIRness: annotating scientific data and its provenance using data fragment selectors.

Journal of integrative bioinformatics·2026
Same journal

Integrating cross-omics research through FAIR Digital Objects with DataPLANT.

Journal of integrative bioinformatics·2026
Same journal

Pheno-App 2.0 - a mobile app for collecting phenotypic data in plant research.

Journal of integrative bioinformatics·2026
Same journal

Evolving bioinformatics services - the journey of KPI metrics with Scorpion.

Journal of integrative bioinformatics·2026
Same journal

The community engagement and empowerment cycle: FAIRagro's framework to foster cultural change towards FAIR RDM practices in agrosystem science and beyond.

Journal of integrative bioinformatics·2026
See all related articles
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 Experiment Video

Updated: Jun 16, 2026

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

Subgraph queries by context-free grammars.

Petteri Sevon1, Lauri Eronen

  • 1Helsinki Institute for Information Technology, Department of Computer Science,PO Box 68, FI-00014 University of Helsinki, Finland. psevon@cs.helsinki.fi

Journal of Integrative Bioinformatics
|February 6, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces a novel method for graph querying using context-free grammars to find connection subgraphs. Direct subgraph parsing is more effective than path parsing, with bidirectional search doubling path length capabilities.

Related Experiment Videos

Last Updated: Jun 16, 2026

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

Area of Science:

  • Graph theory
  • Computational biology
  • Database querying

Background:

  • Graph databases are increasingly used to represent complex biological data.
  • Querying relationships within these graphs is computationally challenging.
  • Existing methods often struggle with summarizing complex relational information.

Purpose of the Study:

  • To develop a novel method for querying vertex- and edge-labeled graphs.
  • To introduce and solve the problem of finding connection subgraphs induced by matching paths.
  • To present efficient algorithms for direct subgraph parsing.

Main Methods:

  • Utilizing context-free grammars to define classes of paths.
  • Developing algorithms for direct connection subgraph parsing.
  • Implementing and evaluating bidirectional parsing strategies.

Main Results:

  • Direct connection subgraph parsing is significantly more effective than individual path parsing.
  • Bidirectional parsing algorithms enable searching paths approximately twice as long as unidirectional methods.
  • Experimental validation on biomedical and random graphs confirms algorithm efficiency.

Conclusions:

  • Direct connection subgraph parsing offers a more effective approach for summarizing vertex relationships in graphs.
  • Bidirectional search strategies enhance the capability of graph path querying.
  • The developed methods show promise for applications in complex data analysis, particularly in bioinformatics.