{"title":"基于隐马尔可夫模型的多重蛋白质比对","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":"{\"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}","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}
Alignment of Multiple Proteins with an Ensemble of Hidden Markov Models
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.