Inferring stable genetic networks from steady-state data

DOI10.1016/J.AUTOMATICA.2011.02.006zbMath1235.93028OpenAlexW2135744958WikidataQ57581748 ScholiaQ57581748MaRDI QIDQ665132

Michael M. Zavlanos, Stephen P. Boyd, George J. Pappas, A. Agung Julius

Publication date: 5 March 2012

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2011.02.006

zbMATH Keywords

stabilityconvex optimizationlinear systemsgenetic network identification

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Large-scale systems (93A15) Systems biology, networks (92C42)

Related Items (5)

Scalable reverse‐engineering of gene regulatory networks from time‐course measurements ⋮ Learning low-complexity autoregressive models via proximal alternating minimization ⋮ Blind identification of fully observed linear time-varying systems via sparse recovery ⋮ Invalidation of the structure of genetic network dynamics: a geometric approach ⋮ Probabilistic methods in cancer biology

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Inferring biomolecular interaction networks based on convex optimization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Just relax: convex programming methods for identifying sparse signals in noise
• Matrix Analysis
• Invalidation of the structure of genetic network dynamics: a geometric approach

This page was built for publication: Inferring stable genetic networks from steady-state data