Baum-Welch Learning in Discrete Hidden Markov Models with Linear Factorial Constraints
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Evolving consensus sequence for multiple sequence alignment with a genetic algorithm
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Hi-index | 0.00 |
Multiple sequence alignment (MSA) is a fundamental and challenging problem in the analysis of biologic sequences. In this paper, an immune particle swarm optimization (IPSO) is proposed, which is based on the models of the vaccination and the receptor editing in immune systems. The proposed algorithm is used to train hidden Markov models (HMMs), further, an integration algorithm based on the HMM and IPSO for the MSA is constructed. The approach is tested on a set of standard instances taken from the Benchmark Alignment database, BAliBASE. Numerical simulated results are compared with those obtained by using the Baum-Welch training algorithm. The results show that the proposed algorithm not only improves the alignment abilities, but also reduces the time cost.