1. Abstract Many research groups have described genetic and protein networks as networks of Boolean variables, and provided procedures for reverse engineering. Recently, Laubenbacher and colleagues proposed using finite fields to represent genes and proteins in biological networks. We develop a procedure for error-correction of microarray data based on majority logic decoding, and we develop two procedures for reverse engineering finite field networks: one produces functions over a single uniform finite field and another functions over different finite sets. We demonstrate the utility of finite fields by applying the techniques to a data set developed at the University of Puerto Rico, from rats trained in a memory task called conditioned taste aversion. We introduce the definition of dynamical systems over different finite sets and we present applications to biological networks (like regulatory and protein networks). In our model we consider variables over sets with different numbers of elements. This work provides a mathematical model for the biological methods developed by Thomas and colleagues. The importance of our model is that we give a formalism that allows us to solve the reverse engineering problem.  María Alicia Aviñó, UPR-Cayey  Edusmildo Orozco, UPR-Mayagüez  Humberto Ortiz-Zuazuaga, HPCf, UPR-Rio Piedras Dynamical Systems of Protein and Gene Networks A Dynamical system over different finite sets is: We prove that all the functions which act over a regulatory network can be represented as a polynomial function in one variable or in several variables over a finite field.  Sandra Peña de Ortiz, UPR- Rio Piedras  Dorothy Bollman, UPR-Mayagüez  Oscar Moreno, UPR-Rio Piedras Acknowlegements M. Aviñó and O Moreno are supported by CISE MII award EIA-0080926 from the National Science Foundation. H. Ortiz is supported in part by the Puerto Rico BRIN Award P20 RR16470 from the National Center for Research Resources, National Institutes of Health. S. Peña is supported by an Institutional Development Award (IDeA) Program, P20RR15565, from the National Center for Research Resources, National Institutes of Health. E. Orozco and D. Bollman were partially supported by NIH/NIGMS grant No. S06GM08103 and by PRECISE grant NSF #99-77071. Reverse Engineering as Polynomial Interpolation Moreno et al [2, 3] propose solving the reverse engineering problem by looking at each tuple of the time series as an element from a finite field. This framework finds an interpolating polynomial in single variable whose coefficients are from the underlying finite field. There is an algebraic procedure to go from the ONE variable case to the MULTIVARIATE equivalent version proposed by Laubenbacher [4]. R. Laubenbacher [4, 5] and our group propose to reverse engineer protein networks using a polynomial approach. This mathematical model can be seen in a more simple way by the following expression. where P(x) is the univariate polynomial interpolating the points from the time series and g(x) is a polynomial that vanishes at all interpolating values. P(x) can be computed using Lagrange interpolation. The computational cost of this is O(n 2 ). Example 2 Given the sequence of points r 0 = (0, 1, 0), r 1 = (0, 2, 1), r 2 = (0, 2, 2), r 3 = (2, 0, 0) from GF(3 3 ), find a dynamic network f that satisfies f( r 0 ) = r 1, f( r 1 ) = r 2, f( r 2 ) = r 3. This is equivalent to: Find a polynomial f(x) from K[x], where K = GF(3 3 ), that interpolates the three pair of points (r 0, r 1 ), (r 1, r 2 ), (r 2, r 3 ). Figure 1. A finite Dynamical system over GF(3 3 ) that interpolates the points (α 5, α 2 ), (α 2, α 6 ), (α 6, α 23 ), (α 23, α 10 ). Using Lagrange interpolation we found the polynomial shown at the button of the figure. Brown circles represent the original sequence of points r 0, r 1, r 2, and r 3. This is the multivariate equivalent form of the polynomial f( x ) = α 11 x 2 + α 18 x + α 11 α is what is called a primitive element from the finite field. In this case α = (1, 0, 1). Chinese Remaindering Chinese remaindering is used to solve a system of congruence equations modulo a set of pairwise relatively prime polynomials. Fast Chinese Remaindering Interpolating Polynomial When the modular polynomials are of the form x – x i, the Chinese remaindering theorem is converted to a fast polynomial interpolation algorithm [1]. The complexity for this interpolation algorithm is O( n log 2 n) This algorithm is mainly based on the computation of two sets of intermediate polynomials q(x) and S(x) which are recursive in nature as shown in the following figures. S i + 2 j- 1, j-1 S i, j-1 S i, j Parallel Algorithm 1. Compute q i,j in parallel 2. Compute d i in parallel 3. Compute S i,0 in parallel 4. Compute S i,j : 4.1 for ( j = 1; j <= t; j++ ) 4.2 for ( i = 0; i < k; i+ = 2 j ) in parallel 4.3 Step 0 Step 1 Step 2 Step 3