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.
Liste complète des métadonnées

Contributeur : Ines Abdeljaoued Tej <>
Soumis le : dimanche 7 octobre 2018 - 23:12:20
Dernière modification le : lundi 15 octobre 2018 - 17:28:27


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01889746, version 1



Ines Abdeljaoued-Tej, Alia Benkahla, Ghassen Haddad, Annick Valibouze. A Linear Algorithm For Computing Polynomial Dynamical Systems. 2018. 〈hal-01889746〉



Consultations de la notice


Téléchargements de fichiers