DCA:一种有效的分而治之的方法来同时多序列比对。

J Stoye, V Moulton, A W Dress
{"title":"DCA:一种有效的分而治之的方法来同时多序列比对。","authors":"J Stoye,&nbsp;V Moulton,&nbsp;A W Dress","doi":"10.1093/bioinformatics/13.6.625","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>DCA is a new computer program for multiple sequence alignment which utilizes a 'divide-and-conquer' type of heuristic approach.</p><p><strong>Availability: </strong>The algorithm is freely available from http://bibiserv.TechFak.Uni-Bielefeld.DE/dca/.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1997-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.6.625","citationCount":"115","resultStr":"{\"title\":\"DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.\",\"authors\":\"J Stoye,&nbsp;V Moulton,&nbsp;A W Dress\",\"doi\":\"10.1093/bioinformatics/13.6.625\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Motivation: </strong>DCA is a new computer program for multiple sequence alignment which utilizes a 'divide-and-conquer' type of heuristic approach.</p><p><strong>Availability: </strong>The algorithm is freely available from http://bibiserv.TechFak.Uni-Bielefeld.DE/dca/.</p>\",\"PeriodicalId\":77081,\"journal\":{\"name\":\"Computer applications in the biosciences : CABIOS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1093/bioinformatics/13.6.625\",\"citationCount\":\"115\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer applications in the biosciences : CABIOS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/bioinformatics/13.6.625\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer applications in the biosciences : CABIOS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/13.6.625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 115

摘要

动机:DCA是一种新的计算机程序,用于多序列比对,它利用了“分而治之”类型的启发式方法。可用性:该算法可从http://bibiserv.TechFak.Uni-Bielefeld.DE/dca/免费获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.

Motivation: DCA is a new computer program for multiple sequence alignment which utilizes a 'divide-and-conquer' type of heuristic approach.

Availability: The algorithm is freely available from http://bibiserv.TechFak.Uni-Bielefeld.DE/dca/.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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