Perkins, T., & Hallett, M. (2010). A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data. IEEE/ACM transactions on computational biology and bioinformatics, 7(1), 118-125. https://doi.org/10.1109/TCBB.2008.38
Chicago-Zitierstil (17. Ausg.)Perkins, T.J, und M.T Hallett. "A Trade-Off Between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data." IEEE/ACM Transactions on Computational Biology and Bioinformatics 7, no. 1 (2010): 118-125. https://doi.org/10.1109/TCBB.2008.38.
MLA-Zitierstil (9. Ausg.)Perkins, T.J, und M.T Hallett. "A Trade-Off Between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data." IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 1, 2010, pp. 118-125, https://doi.org/10.1109/TCBB.2008.38.