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.

中文翻译：

---

关于二进制 de Bruijn 序列的贪婪算法

我们提出了一种用于二进制 de Bruijn 序列的通用贪婪算法，称为广义偏好对立（GPO）算法及其修改。通过识别特定的反馈函数和初始状态，我们证明了大多数先前已知的生成二进制 de Bruijn 序列的贪婪算法是我们新算法的特例。