Adaptation of the method of musical composition for solving the multiple sequence alignment problem

This paper presents a novel approach for solving the Multiple Sequence Alignment (MSA) problem. K-Means clustering is combined with the Rubber Band Technique (RBT) to introduce an iterative optimization algorithm, namely RBT-Km, to find the optimal alignment for a set of input protein sequences. In this technique, the MSA problem is modeled as a Rubber Band, while the solution space is modeled as plate with several poles corresponding locations in the input sequences that are most likely to be correlated and/or biologically related. K-Means clustering is then used to discriminate biologically related locations from those that may appear by chance. RBT-Km is tested with one of the well-known benchmarks in this field (BALiBASE 2.0). The results demonstrate the superiority of the proposed technique even in the case of formidable sequences.

The problem of multiple sequence alignment (MSA) in biology has been studied extensively. In this paper we offer sampling based algorithms for MSA that are more accurate than existing algorithms. The performance of our algorithms has been evaluated using the standard BaliBase dataset [10]. We are able to improve the average alignment SP score for ClustalW [9] and MAFFT [6] by 16.39% and 12.2 %, respectively and the TC score by 55.4% and 46.9%, respectively using sampling. Given that ClustalW and MAFFT are some of the most accurate algorithms for MSA currently and are widely used, our algorithms would be of interest to biologists.

This article presents an immune inspired algorithm to tackle the Multiple Sequence Alignment (MSA) problem. MSA is one of the most important tasks in biological sequence analysis. Although this paper focuses on protein alignments, most of the discussion and methodology may also be applied to DNA alignments. The problem of finding the multiple alignment was investigated in the study by Bonizzoni and Vedova and Wang and Jiang, and proved to be a NP-hard (non-deterministic polynomial-time hard) problem. The presented algorithm, called Immunological Multiple Sequence Alignment Algorithm (IMSA), incorporates two new strategies to create the initial population and specific ad hoc mutation operators. It is based on the ‘weighted sum of pairs’ as objective function, to evaluate a given candidate alignment. IMSA was tested using both classical benchmarks of BAliBASE (versions 1.0, 2.0 and 3.0), and experimental results indicate that it is comparable with state-of-the-art multiple alignment algorithms, in terms of quality of alignments, weighted Sums-of-Pairs (SP) and Column Score (CS) values. The main novelty of IMSA is its ability to generate more than a single suboptimal alignment, for every MSA instance; this behaviour is due to the stochastic nature of the algorithm and of the populations evolved during the convergence process. This feature will help the decision maker to assess and select a biologically relevant multiple sequence alignment. Finally, the designed algorithm can be used as a local search procedure to properly explore promising alignments of the search space.

The conventional multiple sequence alignment algorithms are classi ed into two categories: iterative improvement strategies (e.g., [1]) and simulated annealing methods (e.g., [6]). Recently, a genetic algorithm has been used in computational molecular biology as a powerful combinatorial optimizer. A genetic algorithm has been applied to the problem of multiple sequence alignment on a parallel computer (e.g., [7]). In a simple genetic algorithm [3], a solution of a given problem is represented as \chromosomes which consists of bit strings of 0's and 1's. The genetic operations, such as reproduction, crossover and mutation, are applied to a population of chromosomes to create a new population of chromosomes. This process is repeated many times so that we can obtain a nearly optimal alignment. Here, we propose a improved method to apply a genetic algorithm to the problem of multiple sequence aligment. The processing was performed on a Fujitsu SPARCstation 20 and NEC UP4800.

One of the most challenging tasks in bioinformatics is the resolution of Multiple Sequence Alignment (MSA) problem. It consists in comparing a set of protein or DNA sequences, in aim of predicting their structure and function. This paper introduces a new bio-inspired approach to solve such problem. This approach named BA-MSA is based on Bat Algorithm. Bat Algorithm (BA) is a recent evolutionary algorithm inspired from Bats behavior seeking their prey. The proposed approach includes new mechanism to generate initial population. It consists in generating a guide tree for each solution with progressive approach by varying some parameters. The generated guide tree will be enhanced by Hill-Climbing algorithm. In addition, to deal with the premature convergence of BA, a new restart technique is proposed to introduce more diversification when detecting premature convergence. Balibase 2.0 datasets are used for experiments. The comparison with well-known methods as MSA-GA MSA-GA (w\prealign), ClustalW, and SAGA and recent method (BBOMP) shows the effectiveness of the proposed approach.

BackgroundThe inference of homologies among DNA sequences, that is, positions in multiple genomes that share a common evolutionary origin, is a crucial, yet difficult task facing biologists. Its computational counterpart is known as the multiple sequence alignment problem. There are various criteria and methods available to perform multiple sequence alignments, and among these, the minimization of the overall cost of the alignment on a phylogenetic tree is known in combinatorial optimization as the Tree Alignment Problem. This problem typically occurs as a subproblem of the Generalized Tree Alignment Problem, which looks for the tree with the lowest alignment cost among all possible trees. This is equivalent to the Maximum Parsimony problem when the input sequences are not aligned, that is, when phylogeny and alignments are simultaneously inferred.ResultsFor large data sets, a popular heuristic is Direct Optimization (DO). DO provides a good tradeoff between speed, scalability, and competitive scores, and is implemented in the computer program POY. All other (competitive) algorithms have greater time complexities compared to DO. Here, we introduce and present experiments a new algorithm Affine-DO to accommodate the indel (alignment gap) models commonly used in phylogenetic analysis of molecular sequence data. Affine-DO has the same time complexity as DO, but is correctly suited for the affine gap edit distance. We demonstrate its performance with more than 330,000 experimental tests. These experiments show that the solutions of Affine-DO are close to the lower bound inferred from a linear programming solution. Moreover, iterating over a solution produced using Affine-DO shows little improvement.ConclusionsOur results show that Affine-DO is likely producing near-optimal solutions, with approximations within 10% for sequences with small divergence, and within 30% for random sequences, for which Affine-DO produced the worst solutions. The Affine-DO algorithm has the necessary scalability and optimality to be a significant improvement in the real-world phylogenetic analysis of sequence data.

The multiple sequence alignment problem (MSAP) is one of the most difficult problems in computational molecular biology. In this paper, we describe the optimization model and the neighborhood structure on the MSAP, then propose a scheme to solve the MSAP using Simulated Annealing Algorithm. Experiment shows that the scheme is effcient.

Fragmented protein sequence alignment using two-layer particle swarm optimization (FTLPSO)

In this study, the effects of the scoring functions, which are used in multiple sequence alignment problem, to find the biologically meaningful alignment has been investigated. BALiBASE version 3 has been used as benchmark set. Results have been obtained by calculating score values for alignments in benchmark set and investigating whether the higher score is possible for benchmark alignment or not.

Multiple sequence alignment (MSA) is a traditional and still challenging task for time-series analyses. The MSA problem is intrinsically a discrete optimization and, in principle, dynamic programming is available for solving MSA. However, the computation complexity of such algorithms increases exponentially with the number of sequences to be aligned. In this paper, we propose neural time warping (NTW) that relaxes the original MSA to a continuous optimization, in which a neural network is used to model the alignment. We show that the solution of NTW is guaranteed to be a feasible solution of the original discrete problem under mild conditions. Our experimental results suggest that NTW successfully aligns a hundred sequences and significantly outperforms existing methods for solving the MSA problem.

Quality assessment of multiple alignment programs

Growth Optimizer: A powerful metaheuristic algorithm for solving continuous and discrete global optimization problems

The alignment of more than two biological sequences is a widely used technique in a number of areas of computational biology. However, finding an optimal alignment has been shown to be an NP-complete optimization problem. Furthermore, Multiple Sequence Alignment (MSA) can be formulated according to more than one score function, leading to multi-objective formulations of this problem. Due to these reasons, metaheuristics have been proposed to deal with MSA problems. In this paper, we present jMetalMSA, an Open Source software tool for solving MSA problems with multi-objective metaheuristics. Our motivation here is to offer to the scientific community in computational biology, a platform including state-of-the-art optimization algorithms aimed at solving different formulations of the MSA. We describe the main features of jMetalMSA, including the metaheuristics and scores that are currently available. In addition, we show a working example for illustration purposes.

In this research work, we propose a new cooperative aligner based on metaheuristics to find an approximate solution to the multiple-sequence alignment (MSA) problem. The developed approach named HPSOSA apply in the first stage the particle swarm optimisation (PSO) with a crossover operator as a move mechanism for each particle. In the second stage, simulated annealing is incorporated in order to improve worst solutions in the population and to help HPSOSA to escape from local optimum alignment. Simulation results on BaliBASE benchmarks have demonstrated the capability of the proposed method to obtain better results for the MSA problem compared to those produced by some literature works in the same field.

Gap costs for multiple sequence alignment