
Closing in on Time and Space Optimal Construction of Compressed Indexes
Fast and spaceefficient construction of compressed indexes such as comp...
read it

Edge minimization in de Bruijn graphs
This paper introduces the de Bruijn graph edge minimization problem, whi...
read it

On Optimal Operational Sequence of Components in a Warm Standby System
We consider an open problem of optimal operational sequence for the 1ou...
read it

Polygons with Prescribed Angles in 2D and 3D
We consider the construction of a polygon P with n vertices whose turnin...
read it

Completely uniformly distributed sequences based on de Bruijn sequences
We study a construction published by Donald Knuth in 1965 yielding a com...
read it

An efficient algorithm to test forciblyconnectedness of graphical degree sequences
We present an algorithm to test whether a given graphical degree sequenc...
read it

An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
As a partial answer to a question of Rao, a deterministic and customizab...
read it
Efficient constructions of the Prefersame and Preferopposite de Bruijn sequences
The greedy Prefersame de Bruijn sequence construction was first presented by Eldert et al.[AIEE Transactions 77 (1958)]. As a greedy algorithm, it has one major downside: it requires an exponential amount of space to store the length 2^n de Bruijn sequence. Though de Bruijn sequences have been heavily studied over the last 60 years, finding an efficient construction for the Prefersame de Bruijn sequence has remained a tantalizing open problem. In this paper, we unveil the underlying structure of the Prefersame de Bruijn sequence and solve the open problem by presenting an efficient algorithm to construct it using O(n) time per bit and only O(n) space. Following a similar approach, we also present an efficient algorithm to construct the Preferopposite de Bruijn sequence.
READ FULL TEXT
Comments
There are no comments yet.