论文信息 - On the identification of sparse gene regulatory networks

On the identification of sparse gene regulatory networks

A linear dynamical model structure is introduced to describe the gene interactions in a sparse gene regulatory network, which generalizes the set-up in [9]. Techniques from robust statistics based on L1-minimization are introduced to estimate the underlying sparse network from a limited number of observations obtainable from micro-array data. Simulation experiments are carried out to analyze the performance of the algorithm and to demonstrate the potential of the proposed approach.

Ralf Peeters | R. Westra | R. Peeters | Ronald Westra

[1] Dietmar Bauer,et al. SUBSPACE ALGORITHMS , 2003 .

[2] Jesper Tegnér,et al. Reverse engineering gene networks using singular value decomposition and robust regression , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[3] Kathleen Marchal,et al. Bioinformatics: Organisms from Venus, Technology from Jupiter, Algorithms from Mars , 2003, Eur. J. Control.

[4] Patrik D'haeseleer,et al. Genetic network inference: from co-expression clustering to reverse engineering , 2000, Bioinform..

[5] W. Steiger,et al. Least Absolute Deviations: Theory, Applications and Algorithms , 1984 .

[6] Jean-Jacques Fuchs,et al. On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.

[7] J. Fuchs. More on sparse representations in arbitrary bases , 2003 .

[8] J. Hasty,et al. Reverse engineering gene networks: Integrating genetic perturbations with dynamical modeling , 2003, Proceedings of the National Academy of Sciences of the United States of America.