Sorting by Reversals and the Theory of 4-Regular Graphs
Theor. Comput. Sci., Volume abs/1701.07463, 2017.
Abstract We show that the theory of sorting by reversals fits into the well-established theory of circuit partitions of 4-regular multigraphs (which also involves the combinatorial structures of circle graphs and delta-matroids). In this way, we expose strong connections between the two theories that have not been fully appreciated befo...More
Full Text (Upload PDF)
PPT (Upload PPT)