Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

SFG Algebra

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...

Constraints and Statical Determinacy

Constraints and Statical Determinacy

In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...

The Squeeze Theorem

The Squeeze Theorem

Certain mathematical functions exhibit unpredictable or highly variable behavior near specific input values, making direct evaluation of their limits challenging. This complexity may arise from rapid oscillations or irregular patterns that obscure the function’s trend. In such cases, the Squeeze Theorem offers a reliable method for determining limits.According to the Squeeze Theorem, if a function is confined between two other functions near a particular point, and both outer functions approach...

Block Diagram Reduction

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...

BIBO stability of continuous and discrete -time systems

BIBO stability of continuous and discrete -time systems

System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system.

Pole and System Stability

Pole and System Stability

The transfer function is a fundamental concept representing the ratio of two polynomials. The numerator and denominator encapsulate the system's dynamics. The zeros and poles of this transfer function are critical in determining the system's behavior and stability.
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's response.

You might also read

Related Articles

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

Sort by

Same author

On the Number of Control Nodes in Boolean Networks With Degree Constraints.

IEEE transactions on cybernetics·2026

Same author

DiCleavePlus: A Transformer-Based Model to Detect Human Dicer Cleavage Sites Within Cleavage Patterns.

Genes to cells : devoted to molecular & cellular mechanisms·2025

Same author

Toward Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming.

ACS omega·2025

Same author

Enhancing epidemic forecasting with a physics-informed spatial identity neural network.

PloS one·2025

Same author

Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference.

Journal of cheminformatics·2025

Same author

A dynamic programming algorithm for generating chemical isomers based on frequency vectors.

Scientific reports·2025

Search research articles

Related Experiment Video

Updated: May 7, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

An improved satisfiability algorithm for nested canalyzing functions and its application to determining a singleton

Avraham A Melkman¹, Tatsuya Akutsu

¹1 Department of Computer Science, Ben-Gurion University of the Negev , Beer-Sheva, Israel .

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology

|October 1, 2013

Summary

This summary is machine-generated.

Researchers developed a faster algorithm for Boolean satisfiability problems involving nested canalyzing functions, crucial for biological network analysis. This new method improves computational efficiency for finding network attractors, even with positive self-loops.

More Related Videos

Design and Analysis for Fall Detection System Simplification

Design and Analysis for Fall Detection System Simplification

Published on: April 6, 2020

Related Experiment Videos

Last Updated: May 7, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

Design and Analysis for Fall Detection System Simplification

Design and Analysis for Fall Detection System Simplification

Published on: April 6, 2020

Area of Science:

Computational Biology
Theoretical Computer Science
Boolean Networks

Background:

Nested canalyzing functions are significant in biological modeling.
Satisfiability problems for these functions have known computational limits.
Boolean networks are used to model biological systems.

Purpose of the Study:

To improve the time complexity of algorithms for Boolean satisfiability problems with nested canalyzing functions.
To develop a more efficient algorithm for finding singleton attractors in Boolean networks, including those with positive self-loops.

Main Methods:

Developed an improved algorithm for the satisfiability problem of nested canalyzing functions.
Extended the satisfiability algorithm to address Boolean networks with positive self-loops.
Analyzed computational complexity using Big O notation.

Main Results:

Presented an improved time complexity of O(min(2(k), 1.325(k+m), 2(m))poly(m)) for the satisfiability problem.
Achieved a time complexity of O(1.871(n)) for finding singleton attractors in Boolean networks with positive self-loops.

Conclusions:

The new algorithms offer significant computational speedups for analyzing biological networks.
The improved methods broaden the applicability of Boolean network analysis by handling positive self-loops.