Fast and sound two-step algorithms for multiple alignment of nucleic sequences

S. Abdeddaim
{"title":"Fast and sound two-step algorithms for multiple alignment of nucleic sequences","authors":"S. Abdeddaim","doi":"10.1109/IJSIS.1996.565044","DOIUrl":null,"url":null,"abstract":"The authors report on their work on multiple alignment of biological sequences. The observation of actual alignments has lead the authors to formulate heuristics from which they have derived new and efficient algorithms. These two algorithms are very fast and give reasonably good results. They work in two steps: blocks are found in the sequences, and then the sequences are aligned between the blocks. Strong and sound hypotheses made at every step, as well as a new representation of blocks, yield high efficiency of the resulting algorithms.","PeriodicalId":437491,"journal":{"name":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJSIS.1996.565044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

The authors report on their work on multiple alignment of biological sequences. The observation of actual alignments has lead the authors to formulate heuristics from which they have derived new and efficient algorithms. These two algorithms are very fast and give reasonably good results. They work in two steps: blocks are found in the sequences, and then the sequences are aligned between the blocks. Strong and sound hypotheses made at every step, as well as a new representation of blocks, yield high efficiency of the resulting algorithms.
快速和健全的两步算法对核酸序列的多重比对
作者报告了他们在生物序列多重比对方面的工作。对实际排列的观察导致作者制定启发式,从中他们推导出新的有效算法。这两种算法都是非常快的,并且给出了相当好的结果。它们分两步工作:在序列中找到块,然后在块之间对齐序列。每一步都有强大而合理的假设,以及区块的新表示,从而产生高效率的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信