A Linear Algorithm For Computing Polynomial Dynamical Systems

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öbner 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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01890698
Contributor : Ines Abdeljaoued-Tej <>
Submitted on : Monday, October 8, 2018 - 8:23:53 PM
Last modification on : Wednesday, May 15, 2019 - 3:41:16 AM
Long-term archiving on : Wednesday, January 9, 2019 - 4:17:54 PM

Identifiers

  • HAL Id : hal-01890698, version 1

Citation

Ines Abdeljaoued-Tej, Alia Benkahla, Ghassen Haddad, Annick Valibouze. A Linear Algorithm For Computing Polynomial Dynamical Systems. 2018. ⟨hal-01890698⟩

Share

Metrics

Record views

105

Files downloads

137