Meta-MEME: motif-based hidden Markov models of protein families.

W N Grundy, T L Bailey, C P Elkan, M E Baker
{"title":"Meta-MEME: motif-based hidden Markov models of protein families.","authors":"W N Grundy,&nbsp;T L Bailey,&nbsp;C P Elkan,&nbsp;M E Baker","doi":"10.1093/bioinformatics/13.4.397","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>Modeling families of related biological sequences using Hidden Markov models (HMMs), although increasingly widespread, faces at least one major problem: because of the complexity of these mathematical models, they require a relatively large training set in order to accurately recognize a given family. For families in which there are few known sequences, a standard linear HMM contains too many parameters to be trained adequately.</p><p><strong>Results: </strong>This work attempts to solve that problem by generating smaller HMMs which precisely model only the conserved regions of the family. These HMMs are constructed from motif models generated by the EM algorithm using the MEME software. Because motif-based HMMs have relatively few parameters, they can be trained using smaller data sets. Studies of short chain alcohol dehydrogenases and 4Fe-4S ferredoxins support the claim that motif-based HMMs exhibit increased sensitivity and selectivity in database searches, especially when training sets contain few sequences.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1997-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.4.397","citationCount":"219","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer applications in the biosciences : CABIOS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/13.4.397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 219

Abstract

Motivation: Modeling families of related biological sequences using Hidden Markov models (HMMs), although increasingly widespread, faces at least one major problem: because of the complexity of these mathematical models, they require a relatively large training set in order to accurately recognize a given family. For families in which there are few known sequences, a standard linear HMM contains too many parameters to be trained adequately.

Results: This work attempts to solve that problem by generating smaller HMMs which precisely model only the conserved regions of the family. These HMMs are constructed from motif models generated by the EM algorithm using the MEME software. Because motif-based HMMs have relatively few parameters, they can be trained using smaller data sets. Studies of short chain alcohol dehydrogenases and 4Fe-4S ferredoxins support the claim that motif-based HMMs exhibit increased sensitivity and selectivity in database searches, especially when training sets contain few sequences.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Meta-MEME:基于基序的蛋白质家族隐马尔可夫模型。
动机:使用隐马尔可夫模型(hmm)建模相关生物序列的家族,尽管越来越广泛,但至少面临一个主要问题:由于这些数学模型的复杂性,它们需要相对较大的训练集才能准确识别给定的家族。对于已知序列很少的家族,标准线性HMM包含太多参数,无法充分训练。结果:这项工作试图通过产生更小的hmm来解决这个问题,这些hmm精确地模拟了家族的保守区域。这些hmm是使用MEME软件从EM算法生成的基序模型构建而成的。由于基于图案的hmm具有相对较少的参数,因此它们可以使用较小的数据集进行训练。对短链醇脱氢酶和4Fe-4S铁氧化还原蛋白的研究支持了基于基元的hmm在数据库搜索中表现出更高的敏感性和选择性的说法,特别是当训练集包含很少的序列时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A genetic algorithm for multiple molecular sequence alignment. Displaying the information contents of structural RNA alignments: the structure logos. Q-RT-PCR: data analysis software for measurement of gene expression by competitive RT-PCR. SS3D-P2: a three dimensional substructure search program for protein motifs based on secondary structure elements. XDOM, a graphical tool to analyse domain arrangements in any set of protein sequences.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1