Sparse gene regulatory network identification

  • Authors:
  • R. L. M. Peeters;S. Zeemering

  • Affiliations:
  • Department of Mathematics, Universiteit Maastricht, Maastricht, The Netherlands;Department of Mathematics, Universiteit Maastricht, Maastricht, The Netherlands

  • Venue:
  • KDECB'06 Proceedings of the 1st international conference on Knowledge discovery and emergent complexity in bioinformatics
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper a novel method is presented for the identification of sparse dynamical interaction networks, such as gene regulatory networks. This method uses mixed L2/L1 minimization: nonlinear least squares optimization to achieve an optimal fit between the model in state space form and the data, and L1-minimization of the parameter vector to find the sparsest such model possible. In this approach, in contrast to previous research, the dynamical aspects of the model are taken into account, which gives rise to a nonlinear estimation problem. The setup allows for the identification of structured or partially sparse models, so that available prior knowledge on interactions can be incorporated. To investigate the potential for applications, the algorithm is tested on artificial gene regulatory networks.