Applying the Safe-And-Complete Framework to Practical Genome Assembly.

Q3 Computer Science
Sebastian Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I Tomescu
{"title":"Applying the Safe-And-Complete Framework to Practical Genome Assembly.","authors":"Sebastian Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I Tomescu","doi":"10.4230/LIPIcs.WABI.2024.8","DOIUrl":null,"url":null,"abstract":"<p><p>Despite the long history of genome assembly research, there remains a large gap between the theoretical and practical work. There is practical software with little theoretical underpinning of accuracy on one hand and theoretical algorithms which have not been adopted in practice on the other. In this paper we attempt to bridge the gap between theory and practice by showing how the theoretical safe-and-complete framework can be integrated into existing assemblers in order to improve contiguity. The optimal algorithm in this framework, called the <i>omnitig algorithm</i>, has not been used in practice due to its complexity and its lack of robustness to real data. Instead, we pursue a simplified notion of omnitigs (<i>simple omnitigs</i>), giving an efficient algorithm to compute them and demonstrating their safety under certain conditions. We modify two assemblers (wtdbg2 and Flye) by replacing their unitig algorithm with the simple omnitig algorithm. We test our modifications using real HiFi data from the <i>D. melanogaster</i> and the <i>C. elegans</i> genomes. Our modified algorithms lead to a substantial improvement in alignment-based contiguity, with negligible additional computational costs and either no or a small increase in the number of misassemblies.</p>","PeriodicalId":30209,"journal":{"name":"Leibniz International Proceedings in Informatics","volume":"312 ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12037172/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Leibniz International Proceedings in Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.WABI.2024.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/8/26 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

Despite the long history of genome assembly research, there remains a large gap between the theoretical and practical work. There is practical software with little theoretical underpinning of accuracy on one hand and theoretical algorithms which have not been adopted in practice on the other. In this paper we attempt to bridge the gap between theory and practice by showing how the theoretical safe-and-complete framework can be integrated into existing assemblers in order to improve contiguity. The optimal algorithm in this framework, called the omnitig algorithm, has not been used in practice due to its complexity and its lack of robustness to real data. Instead, we pursue a simplified notion of omnitigs (simple omnitigs), giving an efficient algorithm to compute them and demonstrating their safety under certain conditions. We modify two assemblers (wtdbg2 and Flye) by replacing their unitig algorithm with the simple omnitig algorithm. We test our modifications using real HiFi data from the D. melanogaster and the C. elegans genomes. Our modified algorithms lead to a substantial improvement in alignment-based contiguity, with negligible additional computational costs and either no or a small increase in the number of misassemblies.

安全完整框架在基因组组装中的应用。
尽管基因组组装研究历史悠久,但理论与实际工作之间仍存在较大差距。一方面,有一些实用的软件几乎没有理论基础的准确性,另一方面,理论算法尚未在实践中采用。在本文中,我们试图通过展示如何将理论上的安全和完整框架集成到现有的装配器中以改善相邻性来弥合理论与实践之间的差距。该框架中的最优算法称为全能算法(omnitig algorithm),由于其复杂性和对实际数据缺乏鲁棒性,尚未在实践中得到应用。相反,我们追求一种简化的全群概念(简单全群),给出一种有效的算法来计算它们,并证明它们在一定条件下的安全性。我们修改了两个汇编器(wtdbg2和Flye),将它们的统一算法替换为简单的全融合算法。我们使用来自黑腹线虫和秀丽隐杆线虫基因组的真实HiFi数据来测试我们的修改。我们改进的算法大大提高了基于对齐的连续性,而额外的计算成本可以忽略不计,并且错误装配的数量没有增加或只有少量增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.80
自引率
0.00%
发文量
0
审稿时长
22 weeks
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信