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

Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a cylinder...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the key values are 3...
Castigliano's Theorem: Problem Solving01:14

Castigliano's Theorem: Problem Solving

The deflection of a simply supported beam that carries a central point load can be analyzed using structural mechanics principles, particularly by applying Castigliano's theorem. This theorem relates the displacement at the load application point to the partial derivatives of the strain energy in the structure. The simply supported beam with a point load at its center has symmetric reaction forces at the supports, each bearing half of the load. The bending moment at any point along the beam is...

You might also read

Related Articles

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

Sort by
Same author

Liver sinusoid constraints make random search of CD8 T cells for Plasmodium parasites efficient.

bioRxiv : the preprint server for biology·2025
Same author

Evolution of discrepancies in limb asymmetry in Beckwith-Wiedemann spectrum.

Journal of children's orthopaedics·2025
Same author

Link Prediction in Multipartite Graphs With Application to Drug Repositioning Studies.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Circulating Mycobiota Signatures and Cardiovascular Mortality among Patients Undergoing Hemodialysis.

Journal of the American Society of Nephrology : JASN·2025
Same author

Influence of multi-species data on gene-disease associations in substance use disorder using random walk with restart models.

PloS one·2025
Same author

Azacytidine Monotherapy in an Infant With Mosaic NRAS-Driven Juvenile Myelomonocytic Leukemia.

Pediatric blood & cancer·2025
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
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
See all related articles

Related Experiment Video

Updated: May 20, 2026

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

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

Published on: January 16, 2019

The maximum clique enumeration problem: algorithms, applications, and implementations.

John D Eblen1, Charles A Phillips, Gary L Rogers

  • 1Center for Molecular Biophysics, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA.

BMC Bioinformatics
|July 5, 2012
PubMed
Summary
This summary is machine-generated.

This study introduces improved algorithms for maximum clique enumeration (MCE) in large, dense graphs common in bioinformatics. Novel decomposition strategies significantly reduce computation time, making previously intractable problems feasible.

Related Experiment Videos

Last Updated: May 20, 2026

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

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

Published on: January 16, 2019

Area of Science:

  • Computational Biology
  • Data Mining
  • Graph Theory

Background:

  • The maximum clique enumeration (MCE) problem is NP-hard and crucial in data mining and computational biology.
  • Existing MCE algorithms struggle with the extreme size and density of graphs generated from high-throughput data.
  • Fixed-parameter tractability (FPT) algorithms offer improvements but can still face scalability issues.

Purpose of the Study:

  • To develop and test novel algorithmic improvements for the maximum clique enumeration (MCE) problem.
  • To address the challenges of solving MCE on large, dense graphs typical in computational biology.
  • To enhance the feasibility of analyzing complex biological datasets.

Main Methods:

  • Creation of an extensive testbed using transcriptomic datasets from the Gene Expression Omnibus (GEO).
  • Analysis of graph topological features, revealing high maximum clique overlap in real biological data.
  • Development of novel decomposition strategies tailored to these data features.
  • Integration of these strategies with state-of-the-art FPT MCE implementations.

Main Results:

  • Empirical testing identified distinguishing features of real biological data compared to random graphs.
  • A high degree of maximum clique overlap was observed in real transcriptomic data.
  • Novel decomposition strategies were tuned based on these findings.

Conclusions:

  • Algorithmic improvements led to significant reductions in MCE runtime, often by several orders of magnitude.
  • Previously prohibitive computational instances for MCE are now feasible.
  • The study enhances the applicability of MCE in analyzing large-scale biological data.