Canonical Data Structure for Interval Probe Graphs

@inproceedings{Uehara2004CanonicalDS,
  title={Canonical Data Structure for Interval Probe Graphs},
  author={Ryuhei Uehara},
  booktitle={ISAAC},
  year={2004}
}
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition algorithms for the graph class are known. However, the complexity of the graph isomorphism problem for the class is still unknown. In this paper, extended MPQ-trees are proposed to represent the interval probe graphs. An extended MPQtree is canonical and represents all possible permutations of the intervals. The extended… CONTINUE READING