Controllability of Boolean control networks via the Perron-Frobenius theory

Dmitriy Laschov, Michael Margaliot

פרסום מחקרי: פרסום בכתב עתמאמרביקורת עמיתים

תקציר

Boolean control networks (BCNs) are recently attracting considerable interest as computational models for genetic and cellular networks. Addressing control-theoretic problems in BCNs may lead to a better understanding of the intrinsic control in biological systems, as well as to developing suitable protocols for manipulating biological systems using exogenous inputs. We introduce two definitions for controllability of a BCN, and show that a necessary and sufficient condition for each form of controllability is that a certain nonnegative matrix is irreducible or primitive, respectively. Our analysis is based on a result that may be of independent interest, namely, a simple algebraic formula for the number of different control sequences that steer a BCN between given initial and final states in a given number of time steps, while avoiding a set of forbidden states.

שפה מקוריתאנגלית
עמודים (מ-עד)1218-1223
מספר עמודים6
כתב עתAutomatica
כרך48
מספר גיליון6
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - יוני 2012

ASJC Scopus subject areas

  • ???subjectarea.asjc.2200.2207???
  • ???subjectarea.asjc.2200.2208???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Controllability of Boolean control networks via the Perron-Frobenius theory'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי