On the Sound Covering Cycle Problem in Paired de Bruijn Graphs [chapter]

Christian Komusiewicz, Andreea Radulescu
2015 Lecture Notes in Computer Science  
Paired de Bruijn graphs are a variant of classic de Bruijn graphs used in genome assembly. In these graphs, each vertex v is associated with two labels L(v) and R(v). We study the NP-hard Sound Covering Cycle problem which has as input a paired de Bruijn graph G and two integers d and , and the task is to find a length-cycle C containing all arcs of G such that for every vertex v in C and the vertex u which occurs exactly d positions after v in C, we have R(v) = L(u). We present the first exact algorithms for this problem and several variants.
doi:10.1007/978-3-319-19647-3_14 fatcat:4lwcbnc2uzfmrbk3s5waq7adp4