Aggregation algorithm towards large-scale Boolean network analysis

Zhao, Y, Kim, J and Filippone, M (2013) Aggregation algorithm towards large-scale Boolean network analysis. IEEE Transactions on Automatic Control, 58 (8). 8. 1976 - 1985. ISSN 0018-9286



  • Zhao, Y
  • Kim, J
  • Filippone, M
Copyright, Publisher and Additional Information: © 2013 IEEE. This is an author produced version of a paper published in IEEE Transactions on Automatic Control. Uploaded in accordance with the publisher's self-archiving policy. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works
Keywords: Boolean functions; computational complexity; network theory (graphs; Boolean control network; T-cell receptor network; aggregation network; attractors; best acyclic aggregation; biological systems; computational complexity; early flower development network; input-state cycles; large-scale Boolean network dynamics analysis; network graph; subnetwork analysis; Algorithm design and analysis; Biological system modeling; Complexity theory; Computational efficiency; Computational modeling; Steady-state; Acyclic aggregation; Boolean network; attractor; graph aggregation
  • Published: August 2013
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mechanical Engineering (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 23 Oct 2014 14:15
Last Modified: 05 Feb 2018 23:42
Published Version:
Status: Published
Publisher: IEEE
Identification Number: