Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Inference of transition probabilities between the attractors in Boolean networks with perturbation

Yu, Le, Watterson, Steven, Marshall, Stephen and Ghazal, Peter 2009. Inference of transition probabilities between the attractors in Boolean networks with perturbation. Presented at: 2009 IEEE International Workshop on Genomic Signal Processing and Statistics, Minneapolis, MN, USA, 17-21 May 2009. 2009 IEEE International Workshop on Genomic Signal Processing and Statistics. IEEE, 10.1109/GENSIPS.2009.5174376

Full text not available from this repository.

Abstract

This paper investigates the inference of Boolean networks with perturbation (BNp) from simulated data and observed data. We interpret the discretised gene expression levels as attractor states of the underlying network and use the sequence of attractor states to determine the model. We consider the case where a complete sequence of attractors is known and the case where the known attractor states are arrived at by sampling from an underlying sequence of attractors. We apply the resulting algorithm to the interferon regulatory network using gene expression data taken from murine bone-derived macrophage cells infected with cytomegalovirus.

Item Type: Conference or Workshop Item (Paper)
Date Type: Published Online
Status: Published
Schools: Medicine
Publisher: IEEE
ISBN: 9781424447619
Last Modified: 15 Aug 2018 11:15
URI: http://orca.cf.ac.uk/id/eprint/113226

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item