This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the order-k de Bruijn graph with minimum edge count among all orders. We describe an efficient algorithm that solves this problem. Since the edge minimization problem is connected to the BWT compression technique called “tunneling”, the paper also describes a way to minimize the length of a tunneled BWT in such a way that useful properties for sequence analysis are preserved. Thus, it provides significant progress towards a solution to the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).

本文介绍了de Bruijn图边最小化问题，它与de Bruijn图的压缩有关：在所有阶数中找到边数最少的order- k de Bruijn图。我们描述了一种有效的算法来解决这个问题。由于边缘最小化问题与称为“隧道”的 BWT 压缩技术有关，因此本文还描述了一种最小化隧道 BWT 长度的方法，这种方法可以保留序列分析的有用属性。因此，正如 Alanko 等人所述，它在解决开放问题的解决方案方面取得了重大进展，即寻找最小化空间的最佳不相交块。（DCC 2019）。