
Efficient constructions of the Prefersame and Preferopposite de Bruijn sequences
The greedy Prefersame de Bruijn sequence construction was first present...
read it

Longest paths in 2edgeconnected cubic graphs
We prove almost tight bounds on the length of paths in 2edgeconnected ...
read it

On the Hardness and Inapproximability of Recognizing Wheeler Graphs
In recent years several compressed indexes based on variants of the Borr...
read it

Z_2genus of graphs and minimum rank of partial symmetric matrices
The genus g(G) of a graph G is the minimum g such that G has an embeddin...
read it

Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs
We study the problem of online graph exploration on undirected graphs, w...
read it

Simplifying ActivityonEdge Graphs
We formalize the simplification of activityonedge graphs used for visu...
read it

Embedding of Hypercube into Cylinder
Task mapping in modern high performance parallel computers can be modele...
read it
Edge minimization in de Bruijn graphs
This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the orderk 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
Comments
There are no comments yet.