基于divsufsort和基于sais的FM-Index性能比较与分析

Sumayyea Salahuddin, M. Ashfaq, M. Sher, L. Hasan, N. Ahmad
{"title":"基于divsufsort和基于sais的FM-Index性能比较与分析","authors":"Sumayyea Salahuddin, M. Ashfaq, M. Sher, L. Hasan, N. Ahmad","doi":"10.1109/ICCSE.2015.7250220","DOIUrl":null,"url":null,"abstract":"FM-Index and Suffix Array are closely related to each other and are both extremely popular indexes for genomic sequences. They are used in several popular read alignment tools, including Bowtie, Bowtie 2, BWA, and GEM. In literature, there exist several Suffix Array Construction Algorithms (SACA). We have considered two popular SACA techniques: DivSufSort and SAIS. Both techniques construct suffix array in linear time. We have constructed FM-Index using both of these SACA algorithms. In this paper, we comprehensively describe our FM-Index construction approach and compare performance of these two indexes in terms of time for different string types in the Dataset. Our result shows that DivSufSort-based FM-Index performs 3.67% time efficient than SAIS-based FM-Index on 10 out of 11 strings in the Dataset.","PeriodicalId":311451,"journal":{"name":"2015 10th International Conference on Computer Science & Education (ICCSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance comparison & analysis of DivSufSort-based & SAIS-based FM-Index\",\"authors\":\"Sumayyea Salahuddin, M. Ashfaq, M. Sher, L. Hasan, N. Ahmad\",\"doi\":\"10.1109/ICCSE.2015.7250220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"FM-Index and Suffix Array are closely related to each other and are both extremely popular indexes for genomic sequences. They are used in several popular read alignment tools, including Bowtie, Bowtie 2, BWA, and GEM. In literature, there exist several Suffix Array Construction Algorithms (SACA). We have considered two popular SACA techniques: DivSufSort and SAIS. Both techniques construct suffix array in linear time. We have constructed FM-Index using both of these SACA algorithms. In this paper, we comprehensively describe our FM-Index construction approach and compare performance of these two indexes in terms of time for different string types in the Dataset. Our result shows that DivSufSort-based FM-Index performs 3.67% time efficient than SAIS-based FM-Index on 10 out of 11 strings in the Dataset.\",\"PeriodicalId\":311451,\"journal\":{\"name\":\"2015 10th International Conference on Computer Science & Education (ICCSE)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on Computer Science & Education (ICCSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE.2015.7250220\",\"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 10th International Conference on Computer Science & Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2015.7250220","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

FM-Index和Suffix Array关系密切,都是非常流行的基因组序列索引。它们用于几种流行的读取校准工具,包括Bowtie、Bowtie 2、BWA和GEM。在文献中,存在几种后缀阵列构建算法(SACA)。我们考虑了两种流行的SACA技术:DivSufSort和SAIS。这两种技术都在线性时间内构造后缀数组。我们使用这两种SACA算法构建了FM-Index。在本文中,我们全面描述了我们的FM-Index构建方法,并比较了这两种索引在数据集中不同字符串类型的时间方面的性能。我们的结果表明,在数据集的11个字符串中,有10个字符串基于divsufsort的FM-Index比基于sais的FM-Index时间效率高3.67%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance comparison & analysis of DivSufSort-based & SAIS-based FM-Index
FM-Index and Suffix Array are closely related to each other and are both extremely popular indexes for genomic sequences. They are used in several popular read alignment tools, including Bowtie, Bowtie 2, BWA, and GEM. In literature, there exist several Suffix Array Construction Algorithms (SACA). We have considered two popular SACA techniques: DivSufSort and SAIS. Both techniques construct suffix array in linear time. We have constructed FM-Index using both of these SACA algorithms. In this paper, we comprehensively describe our FM-Index construction approach and compare performance of these two indexes in terms of time for different string types in the Dataset. Our result shows that DivSufSort-based FM-Index performs 3.67% time efficient than SAIS-based FM-Index on 10 out of 11 strings in the Dataset.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards interpreting models to orchestrate IaaS multi-cloud infrastructures Learning through participation: Partnership in undergraduate curriculum design and assessment in Chinese higher education Discussion on heuristic teaching method for arithmetic unit design Application of spss software on mental health education for community residents The streaming media technology applying in the E-training of vocational education teacher
×
引用
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