Cargando…
RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem
BACKGROUND: Multiple Sequence Alignment (MSA) has always been an active area of research in Bioinformatics. MSA is mainly focused on discovering biologically meaningful relationships among different sequences or proteins in order to investigate the underlying main characteristics/functions. This inf...
Autores principales: | , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2709253/ https://www.ncbi.nlm.nih.gov/pubmed/19594869 http://dx.doi.org/10.1186/1471-2164-10-S1-S10 |
_version_ | 1782169283835461632 |
---|---|
author | Taheri, Javid Zomaya, Albert Y |
author_facet | Taheri, Javid Zomaya, Albert Y |
author_sort | Taheri, Javid |
collection | PubMed |
description | BACKGROUND: Multiple Sequence Alignment (MSA) has always been an active area of research in Bioinformatics. MSA is mainly focused on discovering biologically meaningful relationships among different sequences or proteins in order to investigate the underlying main characteristics/functions. This information is also used to generate phylogenetic trees. RESULTS: This paper presents a novel approach, namely RBT-GA, to solve the MSA problem using a hybrid solution methodology combining the Rubber Band Technique (RBT) and the Genetic Algorithm (GA) metaheuristic. RBT is inspired by the behavior of an elastic Rubber Band (RB) on a plate with several poles, which is analogues to locations in the input sequences that could potentially be biologically related. A GA attempts to mimic the evolutionary processes of life in order to locate optimal solutions in an often very complex landscape. RBT-GA is a population based optimization algorithm designed to find the optimal alignment for a set of input protein sequences. In this novel technique, each alignment answer is modeled as a chromosome consisting of several poles in the RBT framework. These poles resemble locations in the input sequences that are most likely to be correlated and/or biologically related. A GA-based optimization process improves these chromosomes gradually yielding a set of mostly optimal answers for the MSA problem. CONCLUSION: RBT-GA is tested with one of the well-known benchmarks suites (BALiBASE 2.0) in this area. The obtained results show that the superiority of the proposed technique even in the case of formidable sequences. |
format | Text |
id | pubmed-2709253 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2009 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-27092532009-07-14 RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem Taheri, Javid Zomaya, Albert Y BMC Genomics Research BACKGROUND: Multiple Sequence Alignment (MSA) has always been an active area of research in Bioinformatics. MSA is mainly focused on discovering biologically meaningful relationships among different sequences or proteins in order to investigate the underlying main characteristics/functions. This information is also used to generate phylogenetic trees. RESULTS: This paper presents a novel approach, namely RBT-GA, to solve the MSA problem using a hybrid solution methodology combining the Rubber Band Technique (RBT) and the Genetic Algorithm (GA) metaheuristic. RBT is inspired by the behavior of an elastic Rubber Band (RB) on a plate with several poles, which is analogues to locations in the input sequences that could potentially be biologically related. A GA attempts to mimic the evolutionary processes of life in order to locate optimal solutions in an often very complex landscape. RBT-GA is a population based optimization algorithm designed to find the optimal alignment for a set of input protein sequences. In this novel technique, each alignment answer is modeled as a chromosome consisting of several poles in the RBT framework. These poles resemble locations in the input sequences that are most likely to be correlated and/or biologically related. A GA-based optimization process improves these chromosomes gradually yielding a set of mostly optimal answers for the MSA problem. CONCLUSION: RBT-GA is tested with one of the well-known benchmarks suites (BALiBASE 2.0) in this area. The obtained results show that the superiority of the proposed technique even in the case of formidable sequences. BioMed Central 2009-07-07 /pmc/articles/PMC2709253/ /pubmed/19594869 http://dx.doi.org/10.1186/1471-2164-10-S1-S10 Text en Copyright © 2009 Taheri and Zomaya; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License ( (http://creativecommons.org/licenses/by/2.0) ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Taheri, Javid Zomaya, Albert Y RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem |
title | RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem |
title_full | RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem |
title_fullStr | RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem |
title_full_unstemmed | RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem |
title_short | RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem |
title_sort | rbt-ga: a novel metaheuristic for solving the multiple sequence alignment problem |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2709253/ https://www.ncbi.nlm.nih.gov/pubmed/19594869 http://dx.doi.org/10.1186/1471-2164-10-S1-S10 |
work_keys_str_mv | AT taherijavid rbtgaanovelmetaheuristicforsolvingthemultiplesequencealignmentproblem AT zomayaalberty rbtgaanovelmetaheuristicforsolvingthemultiplesequencealignmentproblem |