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

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...
Block Diagram Reduction01:22

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
Mathematical Modeling: Problem Solving01:29

Mathematical Modeling: Problem Solving

Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...
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...
Methods of Medium Optimization01:28

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

You might also read

Related Articles

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

Sort by
Same author

An integrated computational antigen discovery pipeline with hierarchical filtering for emerging viral variants.

NAR molecular medicine·2026
Same author

Enhancing protein immunogenicity prediction via uncertainty weighted deep ensemble.

Oxford open immunology·2026
Same author

ImmUQBench: a benchmark on uncertainty quantification of protein immunogenicity prediction.

Oxford open immunology·2026
Same author

Epidemiological model calibration via graybox Bayesian optimization.

Infectious Disease Modelling·2026
Same author

Uncertainty-Aware Adaptation of Large Language Models for Protein-Protein Interaction Analysis.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2025
Same author

CYP1B1-AS1 regulates CYP1B1 to promote Coxiella burnetii pathogenesis by inhibiting ROS and host cell death.

Nature communications·2025
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: May 14, 2026

Qualitative and Comparative Cortical Activity Data Analyses from a Functional Near-Infrared Spectroscopy Experiment Applying Block Design
06:18

Qualitative and Comparative Cortical Activity Data Analyses from a Functional Near-Infrared Spectroscopy Experiment Applying Block Design

Published on: December 3, 2020

A novel subgradient-based optimization algorithm for blockmodel functional module identification.

Yijie Wang1, Xiaoning Qian

  • 1Department of Computer Science and Engineering, University of South Florida, Tampa, FL 33620, USA. yijie@mail.usf.edu

BMC Bioinformatics
|February 2, 2013
PubMed
Summary
This summary is machine-generated.

This study introduces a new convex programming algorithm for identifying functional modules in biological networks. The method effectively uncovers sparsely connected yet functionally related protein groups, offering deeper insights into cellular organization.

Related Experiment Videos

Last Updated: May 14, 2026

Qualitative and Comparative Cortical Activity Data Analyses from a Functional Near-Infrared Spectroscopy Experiment Applying Block Design
06:18

Qualitative and Comparative Cortical Activity Data Analyses from a Functional Near-Infrared Spectroscopy Experiment Applying Block Design

Published on: December 3, 2020

Area of Science:

  • Computational Biology
  • Systems Biology
  • Bioinformatics

Background:

  • Functional module identification is key to understanding complex biomolecular interactions and cellular organization.
  • Existing methods often rely on network topology (high edge density), potentially missing modules with sparse connections but similar network roles.
  • Discovering diverse module types is crucial for a comprehensive view of cellular functions.

Purpose of the Study:

  • To develop a novel, efficient algorithm for identifying biologically meaningful functional modules in large-scale biological networks.
  • To address limitations of topological criteria by incorporating network interaction patterns.
  • To explore a new blockmodel module identification framework using convex programming.

Main Methods:

  • Proposed a novel efficient convex programming algorithm utilizing a subgradient method with heuristic path generation.
  • Implemented the algorithm on large-scale protein-protein interaction (PPI) networks from Saccharomyces cerevisiae and Homo sapiens.
  • Compared performance against Simulated Annealing (SA) and Markov Clustering (MCL) algorithms.

Main Results:

  • The algorithm demonstrated comparable network clustering performance to the time-consuming Simulated Annealing (SA) optimization.
  • Preliminary results showed potential in identifying fine-grained functional modules in biological networks.
  • The method effectively identified modules with sparsely connected proteins exhibiting significantly enriched biological functionalities.

Conclusions:

  • The developed convex programming algorithm offers an efficient approach for functional module identification in biological networks.
  • This method can uncover novel types of functional modules missed by traditional topological approaches.
  • The algorithm holds promise for advancing our understanding of cellular functional organization and biomolecular interactions.