File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Discrimination of Attractors with Noisy Nodes in Boolean Networks

TitleDiscrimination of Attractors with Noisy Nodes in Boolean Networks
Authors
KeywordsObservability
Boolean networks
Attractors
Genetic networks
Biomarkers
Issue Date2021
PublisherElsevier. The Journal's web site is located at http://www.elsevier.com/locate/automatica
Citation
Automatica, 2021, v. 130, p. article no. 109630 How to Cite?
AbstractObserving the internal state of the whole system using a small number of sensor nodes is important in analysis of complex networks. Here, we study the problem of determining the minimum number of sensor nodes to discriminate attractors under the assumption that each attractor has at most noisy nodes. We present exact and approximation algorithms for this minimization problem. The effectiveness of the algorithms is also demonstrated by computational experiments using both synthetic data and realistic biological data.
Persistent Identifierhttp://hdl.handle.net/10722/300929
ISSN
2023 Impact Factor: 4.8
2023 SCImago Journal Rankings: 3.502
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorCheng, X-
dc.contributor.authorChing, WK-
dc.contributor.authorGUO, S-
dc.contributor.authorAkutsu, T-
dc.date.accessioned2021-07-06T03:12:11Z-
dc.date.available2021-07-06T03:12:11Z-
dc.date.issued2021-
dc.identifier.citationAutomatica, 2021, v. 130, p. article no. 109630-
dc.identifier.issn0005-1098-
dc.identifier.urihttp://hdl.handle.net/10722/300929-
dc.description.abstractObserving the internal state of the whole system using a small number of sensor nodes is important in analysis of complex networks. Here, we study the problem of determining the minimum number of sensor nodes to discriminate attractors under the assumption that each attractor has at most noisy nodes. We present exact and approximation algorithms for this minimization problem. The effectiveness of the algorithms is also demonstrated by computational experiments using both synthetic data and realistic biological data.-
dc.languageeng-
dc.publisherElsevier. The Journal's web site is located at http://www.elsevier.com/locate/automatica-
dc.relation.ispartofAutomatica-
dc.subjectObservability-
dc.subjectBoolean networks-
dc.subjectAttractors-
dc.subjectGenetic networks-
dc.subjectBiomarkers-
dc.titleDiscrimination of Attractors with Noisy Nodes in Boolean Networks-
dc.typeArticle-
dc.identifier.emailChing, WK: wching@hku.hk-
dc.identifier.authorityChing, WK=rp00679-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.automatica.2021.109630-
dc.identifier.scopuseid_2-s2.0-85103734043-
dc.identifier.hkuros323251-
dc.identifier.volume130-
dc.identifier.spagearticle no. 109630-
dc.identifier.epagearticle no. 109630-
dc.identifier.isiWOS:000663420500009-
dc.publisher.placeUnited Kingdom-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats