Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method

DOI10.1142/S1793524516500406zbMath1338.92041MaRDI QIDQ2799334

M. Azadi, Abolfazl Rezvan, Changiz Eslahchi, Mohsen Alijanpour, Ali Ebrahimi, Rosa Aghdam

Publication date: 8 April 2016

Published in: International Journal of Biomathematics (Search for Journal in Brave)

zbMATH Keywords

Bayesian networkPC algorithmconditional mutual independent testinferring gene regulatory networksMIT score

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Software, source code, etc. for problems pertaining to biology (92-04) Systems biology, networks (92C42)

Uses Software

• pcalg
• TETRAD
• NARROMI
• BENEDICT

Cites Work

• Causation, prediction, and search
• Learning Bayesian networks: The combination of knowledge and statistical data
• A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
• Probabilistic Networks and Expert Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method