Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10662/19104
Registro completo de Metadatos
Campo DCValoridioma
dc.contributor.authorSantander Jiménez, Sergio-
dc.contributor.authorVega Rodríguez, Miguel Ángel-
dc.contributor.authorSousa, Leonel-
dc.date.accessioned2024-01-08T09:15:27Z-
dc.date.available2024-01-08T09:15:27Z-
dc.date.issued2018-
dc.identifier.issn1089-778X-
dc.identifier.urihttp://hdl.handle.net/10662/19104-
dc.descriptionPublicado en: IEEE Transactions on Evolutionary Computation (Volume: 22, Issue: 6, December 2018, pp. 879-893). http://dx.doi.org/10.1109/TEVC.2017.2774599es_ES
dc.description.abstractAmong the different scientific domains where metaheuristics find applicability, bioinformatics represents a particularly challenging field due to the multiple complexity factors involved in the processing of biological data. In this context, the exploration of protein sequence data is remarkably increasing the temporal demands of such biological problems, thus motivating the interest in investigating new approaches that effectively combine bioinspired metaheuristics and parallelism. This paper addresses the reconstruction of ancestral relationships from amino acid sequences by using a multiobjective approach based on the shuffled frog-leaping optimization technique. Due to the inherent parallel nature of this approach, we define different parallel schemes aimed at exploiting the computing capabilities of modern cluster platforms. The experiments performed in five real datasets give account of the relevance of using parallelism-aware metaheuristic designs, as well as the need to consider both parallel performance and solution quality when tackling such difficult optimization scenarios.es_ES
dc.description.sponsorship- Agencia Estatal de Investigación y Fondos FEDER. Ayuda TIN2016-76259-P - Fundação para a Ciência e a Tecnologia. Ayudas UID/CEC/50021/2013 y SFRH/BPD/119220/2016es_ES
dc.format.extent14 p.es_ES
dc.format.mimetypeapplication/pdfen_US
dc.language.isoenges_ES
dc.publisherIEEEes_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectComputación bioinspiradaes_ES
dc.subjectBioinspired computinges_ES
dc.subjectParalelismoes_ES
dc.subjectParallelismes_ES
dc.subjectOptimización multiobjetivoes_ES
dc.subjectMultiobjective optimizationes_ES
dc.subjectBioinformáticaes_ES
dc.subjectBioinformaticses_ES
dc.titleMultiobjective Frog-leaping optimization for the study of ancestral relationships in protein dataes_ES
dc.typepreprintes_ES
dc.description.versionpeerReviewedes_ES
europeana.typeTEXTen_US
dc.rights.accessRightsopenAccesses_ES
dc.subject.unesco1203.17 Informáticaes_ES
dc.subject.unesco1203.15 Heurísticaes_ES
europeana.dataProviderUniversidad de Extremadura. Españaes_ES
dc.identifier.bibliographicCitationSANTANDER-JIMÉNEZ, S., VEGA-RODRÍGUEZ, M.A., y SOUSA, L. (2018). Multiobjective Frog-Leaping Optimization for the Study of Ancestral Relationships in Protein Data. IEEE Transactions on Evolutionary Computation, 22(6), 879-893. http://dx.doi.org/10.1109/TEVC.2017.2774599es_ES
dc.type.versionacceptedVersiones_ES
dc.contributor.affiliationN/Aes_ES
dc.contributor.affiliationUniversidad de Extremadura. Departamento de Tecnología de los Computadores y de las Comunicacioneses_ES
dc.contributor.affiliationUniversidade de Lisboa. Portugal-
dc.relation.publisherversionhttps://doi.org/10.1109/TEVC.2017.2774599es_ES
dc.identifier.doi10.1109/TEVC.2017.2774599-
dc.identifier.publicationtitleIEEE Transactions on Evolutionary Computationes_ES
dc.identifier.publicationissue6es_ES
dc.identifier.publicationfirstpage879es_ES
dc.identifier.publicationlastpage893es_ES
dc.identifier.publicationvolume22es_ES
dc.identifier.orcid0000-0002-2862-2026es_ES
dc.identifier.orcid0000-0002-3003-758Xes_ES
dc.identifier.orcid0000-0002-8066-221Xes_ES
Colección:DTCYC - Artículos

Archivos
Archivo Descripción TamañoFormato 
TEVC_2017_2774599.pdf2,12 MBAdobe PDFDescargar


Este elemento está sujeto a una licencia Licencia Creative Commons Creative Commons