Search

Multiple Sequence Alignment (MSA) is one of the main topics in the in bioinformatics domain, consists finding an optimal alignment for three or more biological sequences with the number maximum of conserved zones or totally aligned columns. Different scores to assess the quality of the alignments have been proposed, so the problem can be formulated and resolved as a Multi-Objective Optimization Problem (MOP). For this reason, in this paper we present a Multi- Objective approach applied to MSA. We have considered state-of-the-art optimization algorithms aimed at solving different formulations of the MSA: NSGAII, NSGA-III, SPEA2, MOCell, SMS-EMOA, MOEA/D and GWASF-GA. Furthermore we have considered some popular metrics as objectives to be optimized: The weighted Sum-Of-Pairs with a ne gap penalties (wSOP), the Totally Aligned Columns (TC), STRIKE and BaliScore. Finally we have described the main features of our software jMetalMSA, a Multi-Objective optimization software tool applied to MSA problem and illustrated a working example for experimentations purposes. [ABSTRACT FROM AUTHOR]

Proper management of projects has become an element of vital importance for the solution to problems of society. In this context, there are two main objectives to be solved: the construction of project plans which may comply with the constraints of the problem and the optimization in terms of cost and time of those plans. To this end, all activities of project must be organized in such way that the constraints related to the precedence among them and the availability of renewable and non-renewable resources at each instant of time are met. The aim of this paper is to present an Estimation of Distribution Algorithm (EDA), which incorporates the handling of the constraints in the probabilistic model, for the construction of optimal or quasi-optimal project plans. For the validation of the algorithm, authors used both the PSPLib database repository for the development of the scheduling research and the databases of projects of the Repository for Research in Project Management, University of Infomatic Sciences. [ABSTRACT FROM AUTHOR]

In this paper, we compare, from a theoretical and a practical viewpoint, two settings of a certain tax-programming problem and the algorithms proposed for solving it. This problem may be modeled as a parametric quadratic-programming problem having lower and upper bounds on the variables. The objective function is a quadratic function whose Hessian matrix is diagonal and positive. A term is added that penalizes not to achieving a certain goal. This penalization can be formulated either as an absolute or as a quadratic deviation. [ABSTRACT FROM AUTHOR]