Publicação
AlineaGA - a genetic algorithm with local search optimization for multiple sequence alignment
| datacite.subject.fos | Ciências Naturais::Ciências da Computação e da Informação | |
| datacite.subject.sdg | 03:Saúde de Qualidade | |
| datacite.subject.sdg | 07:Energias Renováveis e Acessíveis | |
| datacite.subject.sdg | 11:Cidades e Comunidades Sustentáveis | |
| dc.contributor.author | Silva, Fernando José Mateus da | |
| dc.contributor.author | Pérez, Juan Manuel Sánchez | |
| dc.contributor.author | Pulido, Juan Antonio Gómez | |
| dc.contributor.author | Rodríguez, Miguel A. Vega | |
| dc.date.accessioned | 2025-12-18T10:21:24Z | |
| dc.date.available | 2025-12-18T10:21:24Z | |
| dc.date.issued | 2009-06-30 | |
| dc.description.abstract | The alignment and comparison of DNA, RNA and Protein sequences is one of the most common and important tasks in Bioinformatics. However, due to the size and complexity of the search space involved, the search for the best possible alignment for a set of sequences is not trivial. Genetic Algorithms have a predisposition for optimizing general combinatorial problems and therefore are serious candidates for solving multiple sequence alignment tasks. Local search optimization can be used to refine the solutions explored by Genetic Algorithms. We have designed a Genetic Algorithm which incorporates local search for this purpose: AlineaGA. We have tested AlineaGA with representative sequence sets of the globin family. We also compare the achieved results with the results provided by T-COFFEE. | eng |
| dc.identifier.citation | da Silva, F.J.M., Sánchez Pérez, J.M., Gómez Pulido, J.A. et al. AlineaGA—a genetic algorithm with local search optimization for multiple sequence alignment. Appl Intell 32, 164–172 (2010). https://doi.org/10.1007/s10489-009-0189-4. | |
| dc.identifier.doi | 10.1007/s10489-009-0189-4 | |
| dc.identifier.eissn | 1573-7497 | |
| dc.identifier.issn | 0924-669X | |
| dc.identifier.uri | http://hdl.handle.net/10400.8/15145 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | |
| dc.publisher | Springer Nature | |
| dc.relation.hasversion | https://link.springer.com/article/10.1007/s10489-009-0189-4 | |
| dc.relation.ispartof | Applied Intelligence | |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Multiple sequence alignments | |
| dc.subject | Genetic algorithms | |
| dc.subject | Local search | |
| dc.subject | Optimization | |
| dc.subject | Hybridization | |
| dc.subject | Bioinformatics | |
| dc.title | AlineaGA - a genetic algorithm with local search optimization for multiple sequence alignment | eng |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 172 | |
| oaire.citation.startPage | 164 | |
| oaire.citation.title | Applied Intelligence | |
| oaire.citation.volume | 32 | |
| oaire.version | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |
| person.familyName | Silva | |
| person.givenName | Fernando | |
| person.identifier.ciencia-id | 9D19-84F9-F1CA | |
| person.identifier.orcid | 0000-0001-9335-1851 | |
| person.identifier.scopus-author-id | 24402946400 | |
| relation.isAuthorOfPublication | 2db213d9-a071-4f43-9544-1295ebb6ffde | |
| relation.isAuthorOfPublication.latestForDiscovery | 2db213d9-a071-4f43-9544-1295ebb6ffde |
Ficheiros
Principais
1 - 1 de 1
Miniatura indisponível
- Nome:
- AlineaGA-a genetic algorithm with local search optimization for multiple sequence alignment.pdf
- Tamanho:
- 848.55 KB
- Formato:
- Adobe Portable Document Format
- Descrição:
- The alignment and comparison of DNA, RNA and Protein sequences is one of the most common and important tasks in Bioinformatics. However, due to the size and complexity of the search space involved, the search for the best possible alignment for a set of sequences is not trivial. Genetic Algorithms have a predisposition for optimizing general combinatorial problems and therefore are serious candidates for solving multiple sequence alignment tasks. Local search optimization can be used to refine the solutions explored by Genetic Algorithms. We have designed a Genetic Algorithm which incorporates local search for this purpose: AlineaGA. We have tested AlineaGA with representative sequence sets of the globin family. We also compare the achieved results with the results provided by T-COFFEE.
Licença
1 - 1 de 1
Miniatura indisponível
- Nome:
- license.txt
- Tamanho:
- 1.32 KB
- Formato:
- Item-specific license agreed upon to submission
- Descrição: