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]

FuzzyPred is an unsupervised-learning data-mining algorithm, which allows extracting fuzzy predicates in normal forms from the data. This method is used to solve a descriptive task where it is not known the kind of relationships that are to be found. The goal is to find patterns that describe the data and their relationships. Due to the large set of solutions or search space that may have, it was modeled as an optimization problem, where metaheuristics are applied to find good solutions. FuzzyPred provides as a result a set of predicates, evaluated in each of the quality measures, in spite of the fact that only one of the measures is optimized (truth value). This paper introduces a multiobjective approach for FuzzyPred by using two of the most known multi-objective optimization techniques: Pareto technique (or pure multi-objective) and weighted factors. An experimental study is presented in order to compare the efficacy of both techniques in this problem. The results in several international databases show that better results are obtained by the pure multi-objective technique. [ABSTRACT FROM AUTHOR]