“…We reformulate Problem 1 of finding a proper derived genome G from the measurement data as a graph-theoretic problem. First, we define the diploid interval adjacency graph (DIAG), which can be viewed as a generalization of a breakpoint graph used in the area of comparative genomics [1,65,3], or graphs used in the area of structural analysis of normal and cancer genomes with haploid reference structure [36,42,32,12,15,35]. A DIAG G(R, É A N ) = (V , E) is constructed on a set {1, 2, … , m} of segments, and a set A = A(R) ‰ H( É A N ) of adjacencies.…”