An efficient top-down search algorithm for learning Boolean networks of gene expression
Cited 11 times inCited 13 times in
- An efficient top-down search algorithm for learning Boolean networks of gene expression
- Nam, Dougu; Seo, Seunghyun; Kim, Sangsoo
- Boolean network; Core search; Coupon collection problem; Data consistency; Random superset selection
- Issue Date
- MACHINE LEARNING, v.65, no.1, pp.229 - 245
- Boolean networks provide a simple and intuitive model for gene regulatory networks, but a critical defect is the time required to learn the networks. In recent years, efficient network search algorithms have been developed for a noise-free case and for a limited function class. In general, the conventional algorithm has the high time complexity of O(22k mn k+1) where m is the number of measurements, n is the number of nodes (genes), and k is the number of input parents. Here, we suggest a simple and new approach to Boolean networks, and provide a randomized network search algorithm with average time complexity O (mn k+1/ (log m)(k-1)). We show the efficiency of our algorithm via computational experiments, and present optimal parameters. Additionally, we provide tests for yeast expression data.
- ; Go to Link
Appears in Collections:
- SLS_Journal Papers
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.