An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Graph classes: a survey
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM (JACM)
A polynomial time recognition algorithm for probe interval graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Two tricks to triangulate chordal probe graphs in polynomial time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
Journal of Computer and System Sciences
Simple geometrical intersection graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
| Hi-index | 0.00 |
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 ${\mathcal MPQ}$-trees are proposed to represent the interval probe graphs An extended ${\mathcal MPQ}$-tree is canonical and represents all possible permutations of the intervals The extended ${\mathcal MPQ}$-tree can be constructed from a given interval probe graph in polynomial time Thus we can solve the graph isomorphism problem for the interval probe graphs in polynomial time Using the tree, we can determine that any two nonprobes are independent, overlapping, or their relation cannot be determined without an experiment Therefore, we can heuristically find the best nonprobe that would be probed in the next experiment Also, we can enumerate all possible affirmative interval graphs for any interval probe graph.