DNA多重比对问题与新DiaWay算法

Athmane Seghier, Ibrahim Chegrane, Chahrazed Ighilaza
{"title":"DNA多重比对问题与新DiaWay算法","authors":"Athmane Seghier, Ibrahim Chegrane, Chahrazed Ighilaza","doi":"10.1109/ISPS.2015.7245005","DOIUrl":null,"url":null,"abstract":"DiaWay is a new efficient and robust algorithm of Multiple as well as pairwise DNA alignment, it is an improvement and re-implementation of the well known DIALIGN approach. In this paper we present the different steps of our approach, from the diagonals extraction and indexation step, to the gathering of the fragments and gaps insertion step, passing through the sorting of the consistent diagonals set for the final alignment. We present two implementations of our approach, the first one called DiaWay 1.0, and the second one called DiaWay 2.0. The results of tests and analysis performed on benchmarks taken from BAliBASE and smart databases show the effectiveness and efficiency of our approach, comparing to DIALIGN 2.2 algorithm in term of execution time.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"DNA multiple alignment problem with the new DiaWay algorithm\",\"authors\":\"Athmane Seghier, Ibrahim Chegrane, Chahrazed Ighilaza\",\"doi\":\"10.1109/ISPS.2015.7245005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"DiaWay is a new efficient and robust algorithm of Multiple as well as pairwise DNA alignment, it is an improvement and re-implementation of the well known DIALIGN approach. In this paper we present the different steps of our approach, from the diagonals extraction and indexation step, to the gathering of the fragments and gaps insertion step, passing through the sorting of the consistent diagonals set for the final alignment. We present two implementations of our approach, the first one called DiaWay 1.0, and the second one called DiaWay 2.0. The results of tests and analysis performed on benchmarks taken from BAliBASE and smart databases show the effectiveness and efficiency of our approach, comparing to DIALIGN 2.2 algorithm in term of execution time.\",\"PeriodicalId\":165465,\"journal\":{\"name\":\"2015 12th International Symposium on Programming and Systems (ISPS)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 12th International Symposium on Programming and Systems (ISPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPS.2015.7245005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 12th International Symposium on Programming and Systems (ISPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2015.7245005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

DiaWay是一种新的高效、鲁棒的多重和成对DNA比对算法,它是对DIALIGN方法的改进和重新实现。在本文中,我们介绍了我们方法的不同步骤,从对角线提取和索引步骤,到片段和间隙插入步骤的收集,通过对一致对角线集的排序进行最终对齐。我们提出了我们的方法的两个实现,第一个称为DiaWay 1.0,第二个称为DiaWay 2.0。从BAliBASE和智能数据库中获取的基准测试和分析结果表明,与DIALIGN 2.2算法相比,我们的方法在执行时间方面具有有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DNA multiple alignment problem with the new DiaWay algorithm
DiaWay is a new efficient and robust algorithm of Multiple as well as pairwise DNA alignment, it is an improvement and re-implementation of the well known DIALIGN approach. In this paper we present the different steps of our approach, from the diagonals extraction and indexation step, to the gathering of the fragments and gaps insertion step, passing through the sorting of the consistent diagonals set for the final alignment. We present two implementations of our approach, the first one called DiaWay 1.0, and the second one called DiaWay 2.0. The results of tests and analysis performed on benchmarks taken from BAliBASE and smart databases show the effectiveness and efficiency of our approach, comparing to DIALIGN 2.2 algorithm in term of execution time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信