Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
(2009) Networks — Vol. 53, n° 2, p. 126-140 (2009)
Files
document.pdf
Restricted Access - Adobe PDF
- 209.52 KB
Details
- Authors
- Abstract
- A basic problem in molecular biology is to rebuild phylogenetic trees (PT) from a set of DNA or protein sequences. Among different criteria used for this purpose, the minimum evolution criterion is an optimality based criterion aiming to rebuild PT characterized by a minimal length. This problem is known to be 𝒩𝒫-hard. We introduce in this article some mixed integer programming models, and we also study possible cuts and lower bounds for the optimal value. So far, the number of sequences that can be involved in optimal phylogenetic reconstruction is still limited to 10.
- Affiliations
ULB Département d'Informatique Universitá Ca' Foscari Dipartimento di Matematica Applicata
Citations
Catanzaro, D., Labbé, M., Pesenti, R., & Salazar-González, J.-J. (2009). Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. Networks, 53(2), 126-140. https://doi.org/10.1002/net.20281 (Original work published 2009)