EurekaMag.com logo
+ Site Statistics
References:
53,869,633
Abstracts:
29,686,251
+ Search Articles
+ Subscribe to Site Feeds
EurekaMag Most Shared ContentMost Shared
EurekaMag PDF Full Text ContentPDF Full Text
+ PDF Full Text
Request PDF Full TextRequest PDF Full Text
+ Follow Us
Follow on FacebookFollow on Facebook
Follow on TwitterFollow on Twitter
Follow on LinkedInFollow on LinkedIn

+ Translate

RBT-L: a location based approach for solving the Multiple Sequence Alignment problem



RBT-L: a location based approach for solving the Multiple Sequence Alignment problem



International Journal of Bioinformatics Research and Applications 6(1): 37-57



This paper presents a novel approach to solve the Multiple Sequence Alignment (MSA) problem. The Rubber Band Technique: Location Base (RBT-L) introduced in this paper, is inspired by the elastic behaviour of a Rubber Band (RB) on a plate with poles. RBT-L is an iterative optimisation algorithm designed and implemented to find the optimal alignment for a set of input protein sequences. RBT-L is tested with one of the well-known benchmarks (BALiBASE 2.0) in this field. The obtained results show the superiority of the proposed technique even in the case of formidable sequences.

(PDF emailed within 0-6 h: $19.90)

Accession: 055333699

Download citation: RISBibTeXText

PMID: 20110208

DOI: 10.1504/IJBRA.2010.031291



Related references

RBT-GA: a novel metaheuristic for solving the Multiple Sequence Alignment problem. Bmc Genomics 10 Suppl 1(): S10-S10, 2009

A Lagrangian relaxation approach for the multiple sequence alignment problem. Journal of Combinatorial Optimization 16(2): 127-154, 2008

Resolving the multiple sequence alignment problem using biogeography-based optimization with multiple populations. Journal of Bioinformatics and Computational Biology 13(4): 1550016-1550016, 2016

Multiple Sequence Alignment Based on a Suffix Tree and Center-Star Strategy: A Linear Method for Multiple Nucleotide Sequence Alignment on Spark Parallel Framework. Journal of Computational Biology, 2017

Simulated annealing algorithm for the multiple sequence alignment problem: the approach of polymers in a random medium. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics 72(3 Pt 1): 031915-031915, 2005

An approach to the inverse folding problem based on the multiple structural alignment. Biofizika 44(4): 620-623, July-August, 1999

IBBOMSA: An Improved Biogeography-based Approach for Multiple Sequence Alignment. Evolutionary Bioinformatics Online 12(): 237-246, 2016

A Novel Approach to Multiple Sequence Alignment Using Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Journal of Biomedical and Health Informatics 20(2): 717-727, 2015

ReformAlign: improved multiple sequence alignments using a profile-based meta-alignment approach. Bmc Bioinformatics 15(): 265-265, 2014

Multiple mapping method: a novel approach to the sequence-to-structure alignment problem in comparative protein structure modeling. Proteins 63(3): 644-661, 2006

Optimization of multiple-sequence alignment based on multiple-structure alignment. Proteins 62(1): 209-217, 2005

Multiple sequence alignment based on profile alignment of intermediate sequences. Journal of Computational Biology 15(7): 767-777, 2008

Improving accuracy of multiple sequence alignment algorithms based on alignment of neighboring residues. Nucleic Acids Research 37(2): 463-472, 2008

Implied alignment: A synapomorphy-based multiple-sequence alignment method and its use in cladogram search. Cladistics 19(3): 261-268, June, 2003

Combining partial order alignment and progressive multiple sequence alignment increases alignment speed and scalability to very large alignment problems. Bioinformatics 20(10): 1546-1556, 2004