File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors

TitleOn the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors
Authors
Issue Date2013
Citation
IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, 2013, v. E96.A, p. 2265-2274 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/193184
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorJIANG, Hen_US
dc.contributor.authorTamura, Ten_US
dc.contributor.authorChing, WKen_US
dc.contributor.authorTatsuya, Ten_US
dc.date.accessioned2013-12-20T02:30:55Z-
dc.date.available2013-12-20T02:30:55Z-
dc.date.issued2013en_US
dc.identifier.citationIEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, 2013, v. E96.A, p. 2265-2274en_US
dc.identifier.urihttp://hdl.handle.net/10722/193184-
dc.languageengen_US
dc.relation.ispartofIEICE Trans. Fundamentals of Electronics, Communications and Computer Sciencesen_US
dc.titleOn the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractorsen_US
dc.typeArticleen_US
dc.identifier.emailChing, WK: wching@hku.hken_US
dc.identifier.authorityChing, WK=rp00679en_US
dc.identifier.doi10.1587/transfun.E96.A.2265-
dc.identifier.hkuros226861en_US
dc.identifier.volumeE96.Aen_US
dc.identifier.spage2265en_US
dc.identifier.epage2274en_US
dc.identifier.isiWOS:000327167400028-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats