Related Experiment Video
Updated: Aug 30, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
Improved Hidden Markov Model training for multiple sequence alignment by a particle swarm optimization-evolutionary
Thomas Kiel Rasmussen1, Thiemo Krink
1EVALife Group, Department of Computer Science, University of Aarhus, Ny Munkegade B540, DK-8000 C Aarhus, Denmark. kiel@daimi.au.dk
Abstract:
Multiple sequence alignment (MSA) is one of the basic problems in computational biology. Realistic problem instances of MSA are computationally intractable for exact algorithms. One way to tackle MSA is to use Hidden Markov Models (HMMs), which are known to be very powerful in the related problem domain of speech recognition. However, the training of HMMs is computationally hard and there is no known exact method that can guarantee optimal training within reasonable computing time. Perhaps the most powerful training method is the Baum-Welch algorithm, which is fast, but bears the problem of stagnation at local optima. In the study reported in this paper, we used a hybrid algorithm combining particle swarm optimization with evolutionary algorithms to train HMMs for the alignment of protein sequences. Our experiments show that our approach yields better alignments for a set of benchmark protein sequences than the most commonly applied HMM training methods, such as Baum-Welch and Simulated Annealing.
Related Concept Videos
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
Hybridization of Atomic Orbitals II
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Hybridization of Atomic Orbitals I
RNA-seq
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while microarray-based...
