Automatic reconstruction of molecular and genetic networks from discrete time series data.

We apply a mathematical algorithm which processes discrete time series data to generate a complete list of Petri net structures containing the minimal number of nodes required to reproduce the data set. The completeness of the list as guaranteed by a mathematical proof allows to define a minimal set of experiments required to discriminate between alternative network structures. This in principle allows to prove all possible minimal network structures by disproving all alternative candidate structures. The dynamic behaviour of the networks in terms of a switching rule for the transitions of the Petri net is part of the result. In addition to network reconstruction, the algorithm can be used to determine how many yet undetected components at least must be involved in a certain process. The algorithm also reveals all alternative structural modifications of a network that are required to generate a predefined behaviour.