Edge minimization in de Bruijn graphs

10/31/2019
by   Uwe Baier, et al.
0

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. This also gives an affirmative answer to the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2020

Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences

The greedy Prefer-same de Bruijn sequence construction was first present...
research
02/22/2022

The Open Problem of Finding a General Classification of Geodetic Graphs

This note describes some open problems that can be examined with the pur...
research
05/03/2023

Frank number and nowhere-zero flows on graphs

An edge e of a graph G is called deletable for some orientation o if the...
research
05/03/2023

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity

Our work concerns algorithms for an unweighted variant of Maximum Flow. ...
research
03/13/2023

Finding Diverse Minimum s-t Cuts

Recently, many studies have been devoted to finding diverse solutions in...
research
02/05/2019

On the Hardness and Inapproximability of Recognizing Wheeler Graphs

In recent years several compressed indexes based on variants of the Borr...
research
08/20/2020

Optimal Network Compression

This paper introduces a formulation of the optimal network compression p...

Please sign up or login with your details

Forgot password? Click here to reset