Identification of stable genetic networks using convex programming
Identification of stable genetic networks using convex programming
复制标题
使用凸规划识别稳定遗传网络
DOI:
10.1109/acc.2008.4586910
复制
发表时间:
2008
期刊:
影响因子:
--
通讯作者:
George Pappas
中科院分区:
文献类型:
--
作者:
M. Zavlanos;A. Julius;Stephen P. Boyd;George Pappas
Gene regulatory networks capture interactions between genes and other cell substances, resulting in various models for the fundamental biological process of transcription and translation. The expression levels of the genes are typically measured in mRNA concentrations in micro-array experiments. In a so called genetic perturbation experiment, small perturbations are applied to equilibrium states and the resulting changes in expression activity are measured. This paper develops a novel algorithm that identifies a sparse stable genetic network that explains noisy genetic perturbation experiments obtained at equilibrium. Our identification algorithm can also incorporate a variety of possible prior knowledge of the network structure, which can be either qualitative, specifying positive, negative or no interactions between genes, or quantitative, specifying a range of interaction strength. Our method is based on a convex programming relaxation for handling the sparsity constraint, and therefore is applicable to the identification of genome-scale genetic networks.
DOI:
10.1073/pnas.95.25.14863
发表时间:
1998-12-08
影响因子:
11.1
作者:
Eisen, MB;Spellman, PT;Botstein, D
通讯作者:
Botstein, D