Abstract
The development of living organisms involves the successive activation of several gene networks. It is often known if activation or inhibition of a given gene occurs in these networks, but their global dynamic remains poorly understood. It is thus important to understand the function of motives contained in such a network, and for this one has to be able to perform knock out experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kaufman M, Soulé C, Thomas R (2007) A new necessary condition on interaction graphs for multistationarity. J Theor Biol 248:675–685
Richard A (2010) Negative circuits and sustained oscillations in asynchronous automata networks. Adv Appl Math 44:378–392
Robert F (1986) Discrete iterations: a metric study, vol 6, Series in computational mathematics. Springer, Berlin/Heidelberg/New York
Soulé C (2006) Mathematical approaches to differentiation and gene regulation. C R Paris Biol 329:13–20
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85–103
Gruber H (2011) Bounding the feedback vertex number of digraphs in terms of vertex degrees. Discrete Appl Math 159(8):872–875
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gruber, H., Richard, A., Soulé, C. (2013). How to Knock Out Feedback Circuits in Gene Networks?. In: Capasso, V., Gromov, M., Harel-Bellan, A., Morozova, N., Pritchard, L. (eds) Pattern Formation in Morphogenesis. Springer Proceedings in Mathematics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20164-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-20164-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20163-9
Online ISBN: 978-3-642-20164-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)