Improved Time Complexities for Learning Boolean Networks

Improved Time Complexities for Learning Boolean Networks

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...

Full description

Bibliographic Details
Main Authors: Chee Keong Kwoh, Yun Zheng
Format: Article
Language:English
Published: MDPI AG 2013-09-01
Series:Entropy
Subjects:
Boolean networks
gene regulatory networks
mutual information
entropy
time complexity
Online Access:http://www.mdpi.com/1099-4300/15/9/3762

Internet

http://www.mdpi.com/1099-4300/15/9/3762

Similar Items