pith. sign in

arxiv: 1810.04069 · v1 · pith:C2Z5DJQHnew · submitted 2018-10-08 · 🧬 q-bio.MN · math.OC

A linear algorithm for computing Polynomial Dynamical System

classification 🧬 q-bio.MN math.OC
keywords polynomialtimealgebraicdynamicalfinitegenelinearmodel
0
0 comments X
read the original abstract

Computation biology helps to understand all processes in organisms from interaction of molecules to complex functions of whole organs. Therefore, there is a need for mathematical methods and models that deliver logical explanations in a reasonable time. For the last few years there has been a growing interest in biological theory connected to finite fields: the algebraic modeling tools used up to now are based on Gr\"obner bases or Boolean group. Let $n$ variables representing gene products, changing over the time on $p$ values. A Polynomial dynamical system (PDS) is a function which has several components, each one is a polynom with $n$ variables and coefficient in the finite field $Z/pZ$ that model the evolution of gene products. We propose herein a method using algebraic separators, which are special polynomials abundantly studied in effective Galois theory. This approach avoids heavy calculations and provides a first Polynomial model in linear time.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.