A Tutorial on the Balanced Minimum Evolution Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2022

A Tutorial on the Balanced Minimum Evolution Problem

Résumé

The Balanced Minimum Evolution Problem (BMEP) is an APX-hard network design problem that consists of finding a minimum length unrooted binary tree (also called a phylogeny) having as a leaf-set a given set of molecular sequences. The optimal solution to the BMEP (i.e., the optimal phylogeny) encodes the hierarchical evolutionary relationships of the input sequences. This information is crucial for a multitude of research fields, ranging from systematics to medical research, passing through drug discovery, epidemiology, ecology, biodiversity assessment and population dynamics. In this article, we introduce the reader to the problem and present the current state-of-the-art; we include the most important achievements reached so far and the challenges that still remain to be addressed.
Fichier principal
Vignette du fichier
CatanzaroFrohnGascuelPesenti_EJOR_2021.pdf (4.56 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03427383 , version 1 (13-11-2021)

Identifiants

Citer

Daniele Catanzaro, Martin Frohn, Olivier Gascuel, Raffaele Pesenti. A Tutorial on the Balanced Minimum Evolution Problem. European Journal of Operational Research, 2022, 300 (1), pp.1-19. ⟨10.1016/j.ejor.2021.08.004⟩. ⟨hal-03427383⟩
75 Consultations
38 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More