ScholarLens Back to search
2012•Unpublished venueRequires access

New algorithm for finding fixed points and cycles of Boolean network

Jinghui Suo, Jitao Sun

Open publisher page 1 citations

Abstract

Boolean networks have been successfully used in modeling biological systems. The fixed points, cycles and transient states that lead to them play an essential role to describe the structure of Boolean networks. In this paper we propose an algorithm to get all the fixed points and cycles of Boolean network by using the results of semi-tensor product and permutation. At last, an example is given to illustrate the efficiency of the obtained results.

About this research paper

What this paper is about

Boolean networks have been successfully used in modeling biological systems. The fixed points, cycles and transient states that lead to them play an essential role to describe the structure of Boolean networks. In this paper we propose an algorithm to get all the fixed points and cycles of Boolean network by using the results of semi-tensor product and permutation. At last, an example is given to illustrate the efficiency of the obtained results.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Boolean networks have been successfully used in modeling biological systems. The fixed points, cycles and transient states that lead to them play an essential role to describe the structure of Boolean networks. In this paper we propose an algorithm to get all the fixed points and cycles of Boolean network by using the results of semi-tensor product and permutation. At last, an example is given to illustrate the efficiency of the obtained results.

Key concepts: Boolean network, And-inverter graph, Product term, Fixed point, Permutation (music), Boolean expression, Computer science, Boolean function

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
New algorithm for finding fixed points and cycles of Boolean network — Research Paper | ScholarLens