An efficient top-down search algorithm for learning Boolean networks of gene expression

DOI10.1007/s10994-006-9014-zzbMath1470.68149OpenAlexW1996640192MaRDI QIDQ851876

Dougu Nam, Seung-Hyun Seo, Sang Soo Kim

Publication date: 22 November 2006

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-006-9014-z

zbMATH Keywords

Boolean networkdata consistencycoupon collection problemcore searchrandom superset selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Systems biology, networks (92C42)

Related Items (6)

Improved time complexities for learning Boolean networks ⋮ On Identification of Boolean Control Networks ⋮ Parameter learning of stochastic Boolean networks ⋮ New results on model reconstruction of Boolean networks with application to gene regulatory networks ⋮ Redefinition of Mutual Information in the Fuzzy Sets Framework for Computational Genomics ⋮ Identification of Boolean control networks

Cites Work

• Performance analysis of a greedy algorithm for inferring Boolean functions
• Error-free and best-fit extensions of partially defined Boolean functions
• On learning gene regulatory networks under the Boolean network model
• A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
• Unnamed Item

This page was built for publication: An efficient top-down search algorithm for learning Boolean networks of gene expression