.png){kind=icon}
.png){kind=icon}
Return
A tutorial on the balanced minimum evolution problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2021.08.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Combinatorial optimization
Balanced minimum evolution problem
Network design
Information entropy
Mathematics of evolution
Phylogenetics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available