Alignment-free Whole Genome Comparison Using k-mer Forests

Gihan Gamage, N. Gimhana, A. Wickramarachchi, V. Mallawaarachchi, I. Perera
{"title":"Alignment-free Whole Genome Comparison Using k-mer Forests","authors":"Gihan Gamage, N. Gimhana, A. Wickramarachchi, V. Mallawaarachchi, I. Perera","doi":"10.1109/ICTer48817.2019.9023714","DOIUrl":null,"url":null,"abstract":"In evolutionary biology, the study of phylogenetics can be considered as one of the main research disciplines. Phylogenetics is based on comparative data, which is mainly DNA sequences or raw sequencing reads. Alignment-based sequencing and alignment-free sequencing are the two main similarity computation methods, which are used to find genetic relatedness of different species. Alignment-based methods are relatively complex and computationally challenging as the genome scales when considering mammalian datasets and complex metagenomic colonies. Moreover, they show poor accuracy in certain cases in genetic comparison due to misalignments and algorithmic tolerances. Alignment-free comparison methods perform much better in genetic distance computation by addressing most of the challenges observed in alignment-based methods. In this paper, we propose a novel alignment-free, pairwise, distance calculation method based on k-mers. With this, we convert longer DNA sequences into simplified k-mer forest structures, which makes the comparison more convenient. Further, we are using a specialized tree pruning approach, which minimizes tree comparison time considerably compared to other alignment-free methods.","PeriodicalId":295675,"journal":{"name":"2019 19th International Conference on Advances in ICT for Emerging Regions (ICTer)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 19th International Conference on Advances in ICT for Emerging Regions (ICTer)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTer48817.2019.9023714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In evolutionary biology, the study of phylogenetics can be considered as one of the main research disciplines. Phylogenetics is based on comparative data, which is mainly DNA sequences or raw sequencing reads. Alignment-based sequencing and alignment-free sequencing are the two main similarity computation methods, which are used to find genetic relatedness of different species. Alignment-based methods are relatively complex and computationally challenging as the genome scales when considering mammalian datasets and complex metagenomic colonies. Moreover, they show poor accuracy in certain cases in genetic comparison due to misalignments and algorithmic tolerances. Alignment-free comparison methods perform much better in genetic distance computation by addressing most of the challenges observed in alignment-based methods. In this paper, we propose a novel alignment-free, pairwise, distance calculation method based on k-mers. With this, we convert longer DNA sequences into simplified k-mer forest structures, which makes the comparison more convenient. Further, we are using a specialized tree pruning approach, which minimizes tree comparison time considerably compared to other alignment-free methods.
利用k-mer森林进行免比对全基因组比较
在进化生物学中,系统发育研究可以被认为是主要的研究学科之一。系统发育是基于比较数据,主要是DNA序列或原始测序读数。基于序列比对和无序列比对是两种主要的相似性计算方法,用于寻找不同物种的遗传亲缘关系。当考虑到哺乳动物数据集和复杂的宏基因组菌落时,基于比对的方法相对复杂且具有计算挑战性。此外,在某些情况下,由于不匹配和算法公差,它们在遗传比较中显示出较差的准确性。无比对方法解决了基于比对的方法存在的大多数问题,在遗传距离计算方面表现得更好。在本文中,我们提出了一种新的基于k-mers的无对齐、成对距离计算方法。通过这种方法,我们将较长的DNA序列转换为简化的k-mer森林结构,从而使比较更加方便。此外,我们使用了一种专门的树修剪方法,与其他不需要对齐的方法相比,这种方法大大减少了树比较时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书