Search

1. Problem: Construct the De Bruijn Graph of a String (BA3D)
2. Problem: Construct the De Bruijn Graph of a Collection of k-mers (BA3E)
3. Problem: Genome Assembly with Perfect Coverage and Repeats (GREP)
4. Problem: Constructing a De Bruijn Graph (DBRU)
5. Term: de Bruijn graph
6. Problem: Generate Contigs from a Collection of Reads (BA3K)
7. Problem: Construct a String Spelled by a Gapped Genome Path (BA3L)
8. Problem: Genome Assembly Using Reads (GASM)
9. Problem: Genome Assembly with Perfect Coverage (PCOV)