GARUDA GATEWAY

Boolean SCC Analysis

Analysis of state transition graphs from Boolean network

by University of Toronto

Gadget Photo

star off star off star off star off star off

0 Use Reviews

Free Download

Category
Modeling
OS
Windows
Release
10/12/2017
Version
1.0
File size
163.5MB
Email
Mail Author
Website
Author Website

You are here

back to list

Description

Analysis of state transition graphs from Boolean network


Analyzes state transition graphs from Boolean network simulations. A steady state is a terminal state within the graph that loops back on to itself. Conversely, a strongly connected component (SCC) is a set of mutually reachable states, which can be considered as a “dynamic steady state” of the network. In the case of SCCs, the internal edge weights (frequencies) of the SCC subgraph are used to define a Markov chain. The average gene expression profile for the SCC is calculated as average expression profile is calculated by multiplying the gene expression profile of each state in the SCC against the stationary distribution this Markov chain.

Screen Shot

"Talks with me"