Repository logo
 
Publication

Parallel AlineaGA: An island parallel evolutionary algorithm for multiple sequence alignment

datacite.subject.fosCiências Naturais::Ciências da Computação e da Informação
datacite.subject.sdg08:Trabalho Digno e Crescimento Económico
datacite.subject.sdg09:Indústria, Inovação e Infraestruturas
datacite.subject.sdg10:Reduzir as Desigualdades
dc.contributor.authorSilva, Fernando José Mateus da
dc.contributor.authorPérez, Juan Manuel Sánchez
dc.contributor.authorPulido, Juan Antonio Gómez
dc.contributor.authorRódriguez, Miguel A. Vega
dc.date.accessioned2025-12-16T17:25:13Z
dc.date.available2025-12-16T17:25:13Z
dc.date.issued2010-12
dc.descriptionEISBN - 978-1-4244-7896-5
dc.description.abstractMultiple sequence alignment is the base of a growing number of Bioinformatics applications. This does not mean that the accuracy of the existing methods corresponds to biologically faultless alignments. Searching for the optimal alignment for a set of sequences is often hindered by the size and complexity of the search space. Parallel Genetic Algorithms are a class of stochastic algorithms which can increase the speed up of the algorithms. They also enhance the efficiency of the search and the robustness of the solutions by delivering results that are better than those provided by the sum of several sequential Genetic Algorithms. AlineaGA is an evolutionary method for solving protein multiple sequence alignment. It uses a Genetic Algorithm on which some of its genetic operators embed a simple local search optimization. We have implemented its parallel version which we now present. Comparing with its sequential version we have observed an improvement in the search for the best solution. We have also compared its performance with ClustalW2 and T-Coffee, observing that Parallel AlineaGA can lead the search for better solutions for the majority of the datasets in study.eng
dc.description.sponsorshipThis work has been partially supported by the Polytechnic Institute of Leiria (Portugal) and the MSTAR project Reference: TIN2008-06491-C04-04/TIN (MICINN Spain).
dc.identifier.citationF. J. M. da Silva, J. M. S. Pérez, J. A. G. Pulido and M. A. V. Rodríguez, "Parallel AlineaGA: An island parallel evolutionary algorithm for multiple sequence alignment," 2010 International Conference of Soft Computing and Pattern Recognition, Cergy-Pontoise, France, 2010, pp. 279-284, doi: https://doi.org/10.1109/SOCPAR.2010.5686492.
dc.identifier.doi10.1109/socpar.2010.5686492
dc.identifier.isbn978-1-4244-7897-2
dc.identifier.isbn978-1-4244-7896-5
dc.identifier.urihttp://hdl.handle.net/10400.8/15097
dc.language.isoeng
dc.peerreviewedyes
dc.publisherIEEE Canada
dc.relation.hasversionhttps://ieeexplore.ieee.org/document/5686492
dc.relation.ispartof2010 International Conference of Soft Computing and Pattern Recognition
dc.rights.uriN/A
dc.subjectMultiple sequence alignments
dc.subjectparallel genetic algorithms
dc.subjectoptimization
dc.subjectbioinformatics
dc.titleParallel AlineaGA: An island parallel evolutionary algorithm for multiple sequence alignmenteng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2010-12
oaire.citation.conferencePlaceCergy-Pontoise, France
oaire.citation.endPage284
oaire.citation.startPage279
oaire.citation.titleProceedings of the 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameSilva
person.givenNameFernando
person.identifier.ciencia-id9D19-84F9-F1CA
person.identifier.orcid0000-0001-9335-1851
person.identifier.scopus-author-id24402946400
relation.isAuthorOfPublication2db213d9-a071-4f43-9544-1295ebb6ffde
relation.isAuthorOfPublication.latestForDiscovery2db213d9-a071-4f43-9544-1295ebb6ffde

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Parallel AlineaGA An Island parallel evolutionary algorithm for multiple sequence alignment.pdf
Size:
437 KB
Format:
Adobe Portable Document Format
Description:
Multiple sequence alignment is the base of a growing number of Bioinformatics applications. This does not mean that the accuracy of the existing methods corresponds to biologically faultless alignments. Searching for the optimal alignment for a set of sequences is often hindered by the size and complexity of the search space. Parallel Genetic Algorithms are a class of stochastic algorithms which can increase the speed up of the algorithms. They also enhance the efficiency of the search and the robustness of the solutions by delivering results that are better than those provided by the sum of several sequential Genetic Algorithms. AlineaGA is an evolutionary method for solving protein multiple sequence alignment. It uses a Genetic Algorithm on which some of its genetic operators embed a simple local search optimization. We have implemented its parallel version which we now present. Comparing with its sequential version we have observed an improvement in the search for the best solution. We have also compared its performance with ClustalW2 and T-Coffee, observing that Parallel AlineaGA can lead the search for better solutions for the majority of the datasets in study.
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.32 KB
Format:
Item-specific license agreed upon to submission
Description: