Modeling and solving string
selection problems
C. N.
Meneses, P. M. Pardalos, M. G. C.
Resende, and A. Vazacopoulos
Proceedings of the 2005
International Symposium on
Mathematical and Computational Biology, pp. 54-64,
2006
ABSTRACT
We consider four important combinatorial problems that arise in
computational biology and show how they can be modeled as integer
programming problems. These models are then solved using
branch-and-boundalgorithms. Computational experiments using real
and simulated data are performed and the effectiveness of the
algorithms is analyzed.
PDF file of full paper
Go back
Mauricio G.C. Resende's Home Page
Last modified: 7 July 2006
Copyright Notice