# On Greedy Algorithms for Binary de Bruijn Sequences

## TL;DR

This paper introduces a versatile greedy algorithm, GPO, for generating binary de Bruijn sequences, unifying many existing algorithms under a common framework and highlighting their underlying connections.

## Contribution

The paper presents the GPO algorithm, a general framework that encompasses and extends previous greedy algorithms for binary de Bruijn sequences.

## Key findings

- Most known greedy algorithms are special cases of GPO
- GPO can generate a wide range of binary de Bruijn sequences
- Identification of specific feedback functions and initial states enhances sequence generation

## Abstract

We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm.