An Explicit Upper Bound for the Approximation Ratio of the Maximum Gene Regulatory Network Problem.
Sergio PozziGianluca Della VedovaGiancarlo MauriPublished in: CMSB (2004)
Keyphrases
- upper bound
- approximation ratio
- gene regulatory networks
- approximation algorithms
- lower bound
- np hard
- worst case
- greedy algorithm
- network model
- reverse engineering
- gene expression data
- special case
- search algorithm
- gene networks
- undirected graphical models
- biological data
- partition function
- minimum cost
- constant factor
- structure learning
- bayesian inference
- dynamic bayesian networks
- sample size
- data mining
- knapsack problem
- microarray
- statistical analysis
- computational complexity
- optimal solution
- artificial intelligence
- databases
- metropolis hastings algorithm