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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

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

Ogive Graph

5.6K
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...
5.6K
Time-Series Graph00:54

Time-Series Graph

4.3K
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...
4.3K
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.5K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.5K
Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

3.7K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
3.7K
Bar Graph01:07

Bar Graph

16.0K
A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
16.0K

You might also read

Related Articles

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

Sort by
Same author

RASMA: a reverse search algorithm for mining maximal frequent subgraphs.

BioData mining·2021
Same author

A linear delay algorithm for enumerating all connected induced subgraphs.

BMC bioinformatics·2019
Same author

Big data - a 21st century science Maginot Line? No-boundary thinking: shifting from the big data paradigm.

BioData mining·2015
Same author

A microRNA-1280/JAG2 network comprises a novel biological target in high-risk medulloblastoma.

Oncotarget·2015
Same author

Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets.

BioData mining·2014
Same author

Mining maximal cohesive induced subnetworks and patterns by integrating biological networks with gene profile data.

Interdisciplinary sciences, computational life sciences·2013
Same journal

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

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jun 7, 2025

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.1K

Mining contextually meaningful subgraphs from a vertex-attributed graph.

Riyad Hakim1, Saeed Salem2

  • 1Computer Science, North Dakota State University, Fargo, North Dakota, USA.

BMC Bioinformatics
|November 15, 2024
PubMed
Summary
This summary is machine-generated.

We developed an efficient algorithm to find significant protein subnetworks. This method identifies cohesive connected subgraphs with similar attributes, aiding in understanding cellular functions and disease mechanisms.

Keywords:
Attributed graphClosed subgraphCohesive subgraphMaximal subgraphMinimum supportSubgraph enumeration

More Related Videos

Cloud-Based Phrase Mining and Analysis of User-Defined Phrase-Category Association in Biomedical Publications
09:20

Cloud-Based Phrase Mining and Analysis of User-Defined Phrase-Category Association in Biomedical Publications

Published on: February 23, 2019

8.7K
Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.2K

Related Experiment Videos

Last Updated: Jun 7, 2025

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.1K
Cloud-Based Phrase Mining and Analysis of User-Defined Phrase-Category Association in Biomedical Publications
09:20

Cloud-Based Phrase Mining and Analysis of User-Defined Phrase-Category Association in Biomedical Publications

Published on: February 23, 2019

8.7K
Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.2K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Systems Biology

Background:

  • Protein-protein interaction (PPI) networks are crucial for understanding cellular functions.
  • Analyzing PPI networks aids in deciphering cellular machinery and identifying functional modules.
  • Integrating network data with gene expression and annotations enhances biological discoveries.

Purpose of the Study:

  • To develop an efficient enumeration approach for mining connected and cohesive subgraphs with similar attribute profiles.
  • To address the challenge of numerous overlapping subgraphs by proposing the enumeration of closed subgraphs.
  • To demonstrate the biological significance of mined subnetworks in cancer-related PPI data.

Main Methods:

  • An enumeration approach for mining cohesive connected subgraphs with similar attribute profiles.
  • Proposed algorithm enumerates closed subgraphs to ensure representativeness and reduce overlap.
  • Implemented pruning strategies to optimize search tree traversal, avoiding missed patterns and duplicates.

Main Results:

  • Successfully mined closed cohesive connected subnetworks from a real protein-protein interaction network.
  • Demonstrated the biological significance of the identified subnetworks in the context of multiple cancers.
  • Comparative runtime analysis confirmed the efficiency of the proposed algorithm over existing methods.

Conclusions:

  • The proposed algorithm efficiently enumerates representative cohesive connected subnetworks.
  • The method effectively identifies biologically significant subnetworks from complex PPI data.
  • This approach offers a valuable tool for systems biology research and disease mechanism discovery.