约束多序列比对工具的开发及其在RNase家族比对中的应用。

Chuan Yi Tang, Chin Lung Lu, Margaret Dah-Tsyr Chang, Yin-Te Tsai, Yuh-Ju Sun, Kun-Mao Chao, Jia-Ming Chang, Yu-Han Chiou, Chia-Mao Wu, Hao-Teng Chang, Wei-I Chou
{"title":"约束多序列比对工具的开发及其在RNase家族比对中的应用。","authors":"Chuan Yi Tang,&nbsp;Chin Lung Lu,&nbsp;Margaret Dah-Tsyr Chang,&nbsp;Yin-Te Tsai,&nbsp;Yuh-Ju Sun,&nbsp;Kun-Mao Chao,&nbsp;Jia-Ming Chang,&nbsp;Yu-Han Chiou,&nbsp;Chia-Mao Wu,&nbsp;Hao-Teng Chang,&nbsp;Wei-I Chou","doi":"","DOIUrl":null,"url":null,"abstract":"<p><p>In this paper, we design an algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O (alphaKn4), where n is the maximum of the lengths of sequences. In addition, we have build up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.</p>","PeriodicalId":87204,"journal":{"name":"Proceedings. IEEE Computer Society Bioinformatics Conference","volume":"1 ","pages":"127-37"},"PeriodicalIF":0.0000,"publicationDate":"2002-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constrained multiple sequence alignment tool development and its application to RNase family alignment.\",\"authors\":\"Chuan Yi Tang,&nbsp;Chin Lung Lu,&nbsp;Margaret Dah-Tsyr Chang,&nbsp;Yin-Te Tsai,&nbsp;Yuh-Ju Sun,&nbsp;Kun-Mao Chao,&nbsp;Jia-Ming Chang,&nbsp;Yu-Han Chiou,&nbsp;Chia-Mao Wu,&nbsp;Hao-Teng Chang,&nbsp;Wei-I Chou\",\"doi\":\"\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>In this paper, we design an algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O (alphaKn4), where n is the maximum of the lengths of sequences. In addition, we have build up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.</p>\",\"PeriodicalId\":87204,\"journal\":{\"name\":\"Proceedings. IEEE Computer Society Bioinformatics Conference\",\"volume\":\"1 \",\"pages\":\"127-37\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE Computer Society Bioinformatics Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Computer Society Bioinformatics Conference","FirstCategoryId":"1085","ListUrlMain":"","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们设计了一种计算约束多序列比对(CMSA)的算法,以保证生成的比对满足用户指定的约束,即某些特定的残基应该对齐在一起。如果需要对齐在一起的残数是一个常数alpha,那么我们的CMSA算法对齐K个序列的时间复杂度为O (alphaKn4),其中n为序列长度的最大值。此外,我们建立了这样一个CMSA软件系统,并对主要催化RNA分子降解的RNase序列进行了多次实验。结果显示了我们方法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Constrained multiple sequence alignment tool development and its application to RNase family alignment.

In this paper, we design an algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O (alphaKn4), where n is the maximum of the lengths of sequences. In addition, we have build up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信