"A Trade-Off between Sample Complexity and Computational Complexity in ..."

Theodore J. Perkins, Michael T. Hallett (2010)

> Home

Details and statistics

DOI: 10.1109/TCBB.2008.38

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  authority control:
- export record
  dblp key:
  - journals/tcbb/PerkinsH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcbb/PerkinsH10
Theodore J. Perkins, Michael T. Hallett:
A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data. IEEE ACM Trans. Comput. Biol. Bioinform. 7(1): 118-125 (2010)

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.