"On the Complexity of Inference and Completion of Boolean Networks from ..."

Hao Jiang et al. (2013)

> Home

Details and statistics

DOI: 10.1587/TRANSFUN.E96.A.2265

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/JiangTCA13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/JiangTCA13
Hao Jiang, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu:
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(11): 2265-2274 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.