Question

A sequence assembly strategy based on these data structures that has supplanted the overlap–layout–consensus strategy involves placing k-mers into a type of these structures named for de Bruijn (“duh broyn”). Reachability is preserved by the transitive reduction of a type of these structures that can be topologically sorted because they have properties abbreviated “D·A” in a three-letter acronym. Causal relationships are typically stored in a (*) “directed” one of these (10[1])structures. (10[2])Adjacency matrices describe these structures that are traversed by Hamiltonian paths. If one of these structures is connected and acyclic, then it is a tree. For 10 points, name these structures consisting of edges and vertices that represent networks. ■END■ (10[1])

Back to tossups

Buzzes

Summary