Exact methods for finding a longest DG-consistent trail in biological networks

EasyChair Preprint no. 2633

Abstract

Systems biology is a recent domain that studies living organisms as they actually are. This approach differs from previous ones by integrating different levels of information (biological, physiological, biochemical, etc.). Specific and efficient processing algorithms still need to be developed. Many approaches dedicated to biological networks comparison (homogeneous or heterogeneous) are based on graph models. The vertices represent the biological components and the edges define their interactions. In this paper, we study the relations between the metabolism and the genome. We focus on detecting chains of reactions catalyzed by products of neighboring genes.

Keyphrases: bio-informatique, Comparaison de réseaux biologiques, procédure par séparation et évaluation, programmation linéaire en nombres entiers

@Booklet{EasyChair:2633,
  author = {Mohamed Lemine Ahmed Sidi and Ronan Bocquillon and Hafedh Mohamed Babou and Cheikh Dhib and Mohamedade Farouk Nanne and Emmanuel Neron and Ameur Soukhal},
  title = {Exact methods for finding a longest DG-consistent trail in biological networks},
  howpublished = {EasyChair Preprint no. 2633},

  year = {EasyChair, 2020}}