Schedule

Participants

Abstracts

Sponsors

Informations

---

SMALL GROUP

Interaction Networks: Foundations and Applications to Biology
January 3 - 6, 2017

This small group aims at gathering national and international experts in interaction networks, coming from mathematics, computer science, or also biology and medical science, and make them discuss and work together through oral communications and common thematic working sessions.
This will be, in particular, the place to survey recent advances in the domain, and also identify open questions, inspire the community with promissing, theoretical or applied, research directions.
To this purpose, boolean automata network will be particularly emphasized, being studied simultaneously as computational models and in a more applied point of view as biological interaction networks (genetic regulation networks, signaling networks, neuron networks…).

Organizing Committee

Pierre Guillon (Aix-Marseille Université)
Kevin Perrot (Aix-Marseille Université)
Elisabeth Remy (Aix-Marseille Université)
Sylvain Sene (Aix-Marseille Université)

Speakers

• Julio Aracena (University of Concepción)

Negative cycle and fixed points in Boolean networks

• Georgia Barlovatz-Meimon (IBISC)

L’inaccessible étoile...

• Florian Bridoux (Aix-Marseille Université)

On the cost of simulating a parallel Boolean automata networks by a block-sequential one

• Jean-Paul Comet (Université Nice Sophia Antipolis)

Réductions symboliques pour les modèles de réseaux génétiques

• Jacques Demongeot (Université Grenoble Alpes)

Complexity and robustness in non-coding genome

• Maximilien Gadouleau (Durham University)

Rang et nombre de points périodiques des systèmes dynamiques finis

• Eric Goles (University Adolfo Ibañez of Chile)

Discrete models of “social interactions"

• Tarek Melliti (IBISC)
  

tba

• Loïc Paulevé (Université Paris-Sud)

Dynamique transitoire et reprogrammation des réseaux booléens

• Elisabeth Remy (Aix-Marseille Université)

tba

• Adrien Richard (Université Nice Sophia Antipolis)

Cycles limites dans les réseaux booléens non-expansifs

• Lilian Salinas (University of Concepción)
  

Enumeration and extension of non-equivalent block-sequential update schedules in Boolean networks

• Nicolas Schabanel (Université Paris Diderot)
  

Folding Turing is hard but feasible

• Anne Siegel (IRISA - Rennes)
  

Identification of logical models for signaling pathways : towards a systems biology loop