A BWT-based algorithm for random de Bruijn sequence construction
From MaRDI portal
Publication:6547923
DOI10.1007/978-3-031-55598-5_9MaRDI QIDQ6547923
Zsuzsanna Lipták, Luca Parmigiani
Publication date: 31 May 2024
spanning treerandom generationBurrows-Wheeler transformLyndon wordsde Bruijn sequencestandard permutationextended BWT
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Burrows-Wheeler transformations and de Bruijn words
- The discrepancy of the lex-least de Bruijn sequence
- A framework for constructing de Bruijn sequences via simple successor rules
- An efficiently generated family of binary de Bruijn sequences
- Investigating the discrepancy property of de Bruijn sequences
- When a dollar makes a BWT
- An extension of the Burrows-Wheeler transform
- An efficient algorithm for the generation of DeBruijn cycles
- Cryptographically Strong de Bruijn Sequences with Large Periods
- A new algorithm for the generation of binary de Bruijn sequences
- Worst-case Analysis of Set Union Algorithms
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Efficient Composited de Bruijn Sequence Generators
- Two Algorithms for Unranking Arborescences
- Sampling random spanning trees faster than matrix multiplication
This page was built for publication: A BWT-based algorithm for random de Bruijn sequence construction
