File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On observability of attractors in Boolean Networks

TitleOn observability of attractors in Boolean Networks
Authors
KeywordsLinear-time
Boolean Networks
Attractor
Issue Date2015
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1001586
Citation
The 2015 IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM 2015), Washington, DC., 9-12 November 2015. In Conference Proceedings, 2015, p. 263-266 How to Cite?
AbstractBoolean network (BN) is a popular mathematical model for revealing the behavior of a genetic regulatory network, and observability plays a vital role in understanding the underlying network feature. However, the observability of attractor cycles, which is an interesting and important problem, has not been addressed in the literature. In this paper, we first proposed a novel problem on attractor observability in BNs. Identification of the minimum set of consecutive nodes can be used to determine uniquely the attractor cycle from the others in the network. We then develop a linear-time algorithm to identify the desired set of nodes. The proposed approaches are demonstrated and verified by numerical examples. The computational results are given to illustrate both the efficiency and effectiveness of our proposed methods.
Persistent Identifierhttp://hdl.handle.net/10722/229803

 

DC FieldValueLanguage
dc.contributor.authorQiu, Y-
dc.contributor.authorCheng, X-
dc.contributor.authorChing, WK-
dc.contributor.authorJiang, H-
dc.contributor.authorAkutsu, T-
dc.date.accessioned2016-08-23T14:13:22Z-
dc.date.available2016-08-23T14:13:22Z-
dc.date.issued2015-
dc.identifier.citationThe 2015 IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM 2015), Washington, DC., 9-12 November 2015. In Conference Proceedings, 2015, p. 263-266-
dc.identifier.urihttp://hdl.handle.net/10722/229803-
dc.description.abstractBoolean network (BN) is a popular mathematical model for revealing the behavior of a genetic regulatory network, and observability plays a vital role in understanding the underlying network feature. However, the observability of attractor cycles, which is an interesting and important problem, has not been addressed in the literature. In this paper, we first proposed a novel problem on attractor observability in BNs. Identification of the minimum set of consecutive nodes can be used to determine uniquely the attractor cycle from the others in the network. We then develop a linear-time algorithm to identify the desired set of nodes. The proposed approaches are demonstrated and verified by numerical examples. The computational results are given to illustrate both the efficiency and effectiveness of our proposed methods.-
dc.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1001586-
dc.relation.ispartofIEEE International Conference on Bioinformatics and Biomedicine Proceedings-
dc.rightsIEEE International Conference on Bioinformatics and Biomedicine Proceedings. Copyright © IEEE.-
dc.rights©2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 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 component of this work in other works.-
dc.subjectLinear-time-
dc.subjectBoolean Networks-
dc.subjectAttractor-
dc.titleOn observability of attractors in Boolean Networks-
dc.typeConference_Paper-
dc.identifier.emailChing, WK: wching@hku.hk-
dc.identifier.authorityChing, WK=rp00679-
dc.identifier.doi10.1109/BIBM.2015.7359690-
dc.identifier.scopuseid_2-s2.0-84962467321-
dc.identifier.hkuros262445-
dc.identifier.spage263-
dc.identifier.epage266-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 160914-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats