Gene clustering with hidden Markov model optimized by PSO algorithm |
| |
Authors: | Mohammad Soruri Javad Sadri S. Hamid Zahiri |
| |
Affiliation: | 1.Faculty of Electrical and Computer Engineering,University of Birjand,Birjand,Iran;2.Department of Computer Science & Software Engineering, Faculty of Engineering and Computer Science, Concordia University, Montreal, Quebec, Canada, H3G 1M8,Montreal,Canada;3.Ferdows Faculty of Engineering,University of Birjand,Birjand,Iran |
| |
Abstract: | Gene clustering is one of the most important problems in bioinformatics. In the sequential data clustering, hidden Markov models (HMMs) have been widely used to find similarity between sequences, due to their capability of handling sequence patterns with various lengths. In this paper, a novel gene clustering scheme based on HMMs optimized by particle swarm optimization algorithm is introduced. In this approach, each gene sequence is described by a specific HMM, and then for each model, its probability to generate individual sequence is evaluated. A hierarchical clustering algorithm based on a new definition of a distance measure has been applied to find the best clusters. Experiments carried out on lung cancer-related genes dataset show that the proposed approach can be successfully utilized for gene clustering. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|