简洁de Bruijn图的空间有效合并
Space-efficient merging of succinct de Bruijn graphs
摘要：
我们提出了一种新的算法，用于合并[Bowe et al. WABI 2012]中介绍的de Bruijn图的简洁表示。我们的算法基于Holt和McMillan的轻量级BWT合并方法[Bionformatics 2014，ACM-BCB 2014]。对于Muggli等人提出的相同问题，我们的算法具有与最先进工具相同的渐近成本[bioRxiv 2017，Bioinformatics 2019]，但它使用的工作空间不到一半。我们的算法的一个新的重要功能，没有发现在任何现有的工具，是它可以计算的可变阶简洁表示的工会图在相同的渐近时间/空间界限。
英文摘要：
We propose a new algorithm for merging succinct representations of de Bruijn graphs introduced in [Bowe et al. WABI 2012]. Our algorithm is based on the lightweight BWT merging approach by Holt and McMillan [Bionformatics 2014, ACM-BCB 2014]. Our algorithm has the same asymptotic cost of the state of the art tool for the same problem presented by Muggli et al. [bioRxiv 2017, Bioinformatics 2019], but it uses less than half of its working space. A novel important feature of our algorithm, not found in any of the existing tools, is that it can compute the Variable Order succinct representation of the union graph within the same asymptotic time/space bounds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
