Actas de congresos
Evolving Phylogenetic Trees: A Multiobjective Approach
Registro en:
9783540737308
Lecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). , v. 4643 LNBI, n. , p. 113 - 125, 2007.
3029743
2-s2.0-38049092631
Autor
Coelho G.P.
Da Silva A.E.A.
Von Zuben F.J.
Institución
Resumen
This work presents the application of the omni-aiNet algorithm - an immune-inspired algorithm originally developed to solve single and multiobjective optimization problems - to the construction of phylogenetic trees. The main goal of this work is to automatically evolve a population of phylogenetic unrooted trees, possibly with distinct topologies, by minimizing at the same time the minimal evolution and the mean-squared error criteria. The obtained set of phylogenetic trees contains non-dominated individuals that form the Pareto front and that represent the trade-off of the two conflicting objectives. The proposal of multiple non-dominated solutions in a single run gives to the user the possibility of having distinct explanations for the difference observed in the terminal nodes of the tree, and also indicates the restrictive feedback provided by the individual application of well-known algorithms for phylogenetic reconstruction that takes into account both optimization criteria, like Neighbor Joining. © Springer-Verlag Berlin Heidelberg 2007. 4643 LNBI
113 125 Felsenstein, J., (2004) Inferring Phylogenies, , Sinauer Associates, Suderland, USA Kidd, K.K., Sgaramella-Zonta, L.A., Phylogenetic analysis: Concepts and methods (1971) The American Journal of Human Genetics, 23, pp. 235-252 Bulmer, M., Use of the method of generalized least squares in reconstructing phylogenies from sequence data (1991) Molecular Biology and Evolution, 8, pp. 868-883 Saitou, N., Nei, M., The neighbor-joining method: A new method for reconstructing phylogenetic trees (1987) Molecular Biology and Evolution, 4 (4), pp. 406-425 Coelho, G.P., Von Zuben, F.J.: omni-aiNet: An immune-inspired approach for omni optimization. In: Bersini, H., Carneiro, J. (eds.) ICARIS 2006. LNCS, 4163, pp. 294-308. Springer, Heidelberg (2006)Fitch, W.M., Margoliash, E., Construction of phylogenetic trees (1967) Science, 155, pp. 279-284 Saitou, N., Imanishi, M., Relative efficiencies of the fitch-margoliash, maximumparsimony, maximum-likelihood, minimum-evolution, and neighbor-joining methods of phylogenetic reconstructions in obtaining the correct tree (1989) Molecular Biology and Evolution, 6, pp. 514-525 Brodal, G.S., Fagerberger, R., Pedersen, C.N.S., Computing the quartet distance between evolutionary trees in time O(n.log(n)) (2004) Algorithmica, 38, pp. 377-395 DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L., On distances between phylogenetic trees (1997) Proceedings of the 8th Annual ACM - SIAM Symposium on Discrete Algorithms, pp. 427-436. , ACM Press, New York DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L., (1991) On computing the nearest neighbor interchange distance, , Mathematics Subject Classification Bryant, D.: A classification of consensus methods for phylogenetics. In: Janowitz, M.F., Lapoint, F.J., Morris, F.R., Mirkin, B., Roberts, F.S. (eds.) Bioconsensus. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 61, American Mathematical Society (2003)Robinson, D.F., Foulds, L.R., Comparison of phylogenetic trees (1981) Mathematical Biosciences, 53, pp. 131-147 Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, C.B., (2002) Evolutionary Algorithms for Solving Multi-Objective Problems, , Kluwer Academic Publishers, New York Deb, K., (2001) Multi-Objective Optimization using Evolutionary Algorithms, , John-Wiley & Sons, Chichester, UK Corne, D.W., Jerram, N.R., Knowles, J.D., Oates, M.J., PESA-II: Region-based selection in evolutionary multiobjective optimization (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., A fast and elitist multiobjective genetic algorithm: NSGA-II (2002) IEEE Transactions on Evolutionary Computation, 6 (2), pp. 182-197 Zitzler, E., Laumanns, M., Thiele, L., SPEA2: Improving the strength pareto evolutionary algorithm (2002) EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 95-100 Atteson, K., The performance of neighbor-joining methods of phylogenetic reconstruction (1999) Algorithmica, 25, pp. 251-278