Improved time complexities for learning boolean networks

• المؤلفون الرئيسيون: Zheng, Yun., Kwoh, Chee Keong.
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2014
• الموضوعات: DRNTU::Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/101312; http://hdl.handle.net/10220/18392
• المؤسسة: Nanyang Technological University

Existing algorithms for learning Boolean networks (BNs) have time complexities of at least O(N · n0:7(k+1)), where n is the number of variables, N is the number of samples and k is the number of inputs in Boolean functions. Some recent studies propose more efficient methods with O(N · n2) time compl...