Skip to main content

Automatic Design of Boolean Networks for Cell Differentiation

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 708))

Abstract

Cell differentiation is the process that denotes a cell type change, typically from a less specialised type to a more specialised one. Recently, a cell differentiation model based on Boolean networks subject to noise has been proposed. This model reproduces the main abstract properties of cell differentiation, such as the attainment of different degrees of differentiation, deterministic and stochastic differentiation, reversibility, induced pluripotency and cell type change. The generic abstract properties of the model have been already shown to match those of the real biological phenomenon. A direct comparison with specific cell differentiation processes and the identification of genetic network features that are linked to specific differentiation traits requires the design of a suitable Boolean network such that its dynamics matches a set of target properties. To the best of our knowledge, the only current method for addressing this problem is a random generate and test procedure.

In this work we present an automatic design method for this purpose, based on metaheuristic algorithms. We devised two variants of the method and tested them against random search on typical abstract differentiation trees. Results, although preliminary, show that our technique is far more efficient than both random search and complete enumeration and it is able to find solutions to instances which were not solved by those techniques.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    In general, the so-called lineage tree may not be a proper tree structure, but rather a graph. However, without loss of generality, in this work we will focus on tree structures.

  2. 2.

    This hypothesis is supported by the observation that cells has a finite lifetime, which enables their dynamics to explore only a portion of the possible attractor transitions.

  3. 3.

    http://tree-edit-distance.dbresearch.uni-salzburg.at/.

  4. 4.

    See [5, 9] for details on this technique.

References

  1. Kauffman, S.A.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22(3), 437–467 (1969)

    Article  MathSciNet  Google Scholar 

  2. Kauffman, S.A.: The origins of order. Oxford University Press, New York (1993)

    Google Scholar 

  3. Serra, R., Villani, M., Barbieri, A., Kauffman, S.A., Colacci, A.: On the dynamics of random Boolean networks subject to noise: attractors, ergodic sets and cell types. J. Theor. Biol. 265(2), 185–193 (2010)

    Article  MathSciNet  Google Scholar 

  4. Villani, M., Barbieri, A., Serra, R.: A dynamical model of genetic networks for cell differentiation. PLoS ONE 6(3), e17703 (2011)

    Article  Google Scholar 

  5. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Article  Google Scholar 

  6. Paroni, A., Graudenzi, A., Caravagna, G., Damiani, C., Mauri, G., Antoniotti, M.: CABeRNET: a cytoscape app for augmented boolean models of gene regulatory NETworks. BMC Bioinformatics 17, 64–75 (2016)

    Article  Google Scholar 

  7. Benedettini, S., Villani, M., Roli, A., Serra, R., Manfroni, M., Gagliardi, A., Pinciroli, C., Birattari, M.: Dynamical regimes and learning properties of evolved boolean networks. Neurocomputing 99, 111–123 (2013)

    Article  Google Scholar 

  8. Braccini, M.: Automatic design of boolean networks for modelling differentiation trees. Master’s thesis, Corso di Studio in Ingegneria e scienze informatiche - Cesena, Università di Bologna (2016)

    Google Scholar 

  9. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, Chapt. 23. Garland Science, 5th edn. (2007)

    Google Scholar 

  11. Bastolla, U., Parisi, G.: A numerical study of the critical line of kauffman networks. J. Theor. Biol. 187(1), 117–133 (1997)

    Article  Google Scholar 

  12. Zlochin, M., Birattari, M., Meuleau, N., Dorigo, M.: Model-based search for combinatorial optimization: a critical survey. Ann. Oper. Res. 131(1), 373–395 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kauffman, S.A.: A proposal for using the ensemble approach to understand genetic regulatory networks. J. Theor. Biol. 230(4), 581–590 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank Alex Graudenzi and Chiara Damiani for helpful discussions and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrea Roli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Braccini, M., Roli, A., Villani, M., Serra, R. (2017). Automatic Design of Boolean Networks for Cell Differentiation. In: Rossi, F., Piotto, S., Concilio, S. (eds) Advances in Artificial Life, Evolutionary Computation, and Systems Chemistry. WIVACE 2016. Communications in Computer and Information Science, vol 708. Springer, Cham. https://doi.org/10.1007/978-3-319-57711-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57711-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57710-4

  • Online ISBN: 978-3-319-57711-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics