Alignment of Multiple Proteins with an Ensemble of Hidden Markov Models

Jia Song, Chunmei Liu, Yinglei Song, Junfeng Qu
{"title":"Alignment of Multiple Proteins with an Ensemble of Hidden Markov Models","authors":"Jia Song, Chunmei Liu, Yinglei Song, Junfeng Qu","doi":"10.1109/ICMLA.2007.90","DOIUrl":null,"url":null,"abstract":"The alignment of multiple protein sequences is a problem of fundamental importance in bioinformatics. In general, the optimal alignment can be obtained through the optimization of an objective function. However, such an optimization task is often computationally intractible, most of the existing alignment tools thus use statistical or machine learning based methods to avoid direct optimizations. In this paper, we develop a new method that can progressively construct and update a set of alignments by adding sequences in certain order to each of the existing alignments. In particular, each of the existing alignments is modeled with a profile hidden markov model (HMM) and an added sequence is aligned to each of these profile HMMs. The profile HMMs in the set are then updated based on the alignments with leading alignment scores. We performed experiments on BaliBASE benchmarks to compare the performance of this new approach with that of other alignment tools. Our experiments showed that, by introducing an integer parameter that controls the number of profile HMMs in the set, we are able to efficiently explore the alignment space and significantly improve the alignment accuracy on sequences with low similarity.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA.2007.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

The alignment of multiple protein sequences is a problem of fundamental importance in bioinformatics. In general, the optimal alignment can be obtained through the optimization of an objective function. However, such an optimization task is often computationally intractible, most of the existing alignment tools thus use statistical or machine learning based methods to avoid direct optimizations. In this paper, we develop a new method that can progressively construct and update a set of alignments by adding sequences in certain order to each of the existing alignments. In particular, each of the existing alignments is modeled with a profile hidden markov model (HMM) and an added sequence is aligned to each of these profile HMMs. The profile HMMs in the set are then updated based on the alignments with leading alignment scores. We performed experiments on BaliBASE benchmarks to compare the performance of this new approach with that of other alignment tools. Our experiments showed that, by introducing an integer parameter that controls the number of profile HMMs in the set, we are able to efficiently explore the alignment space and significantly improve the alignment accuracy on sequences with low similarity.
基于隐马尔可夫模型的多重蛋白质比对
多蛋白序列的比对是生物信息学中一个非常重要的问题。一般来说,最优对齐可以通过目标函数的优化来获得。然而,这样的优化任务通常在计算上难以解决,因此大多数现有的对齐工具使用基于统计或机器学习的方法来避免直接优化。在本文中,我们开发了一种新的方法,通过在每个已存在的序列上按一定的顺序添加序列来逐步构建和更新一组序列。特别是,每个现有的排列都用一个剖面隐马尔可夫模型(HMM)建模,并将一个添加的序列对齐到每个这些剖面HMM。然后根据具有领先对齐分数的对齐来更新集合中的轮廓hmm。我们在BaliBASE基准上进行了实验,以比较这种新方法与其他校准工具的性能。实验表明,通过引入一个整数参数来控制集合中轮廓hmm的数量,我们能够有效地探索对齐空间,并显著提高低相似度序列的对齐精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信