Characteristic of Probe Interval Graph and Determination of Probe Interval Graph with MD-PQ Tree

Abstract

Probe interval graph was introduced as a generalization of interval graphs in physical mapping of DNA. A graph G = (V,E) is a probe interval graph if the vertex set can be partitioned into subsets, probe and non-probe, and there is an interval corresponding to each vertices such that two vertices are adjacent if and only if their corresponding intervals intersect, and at least one of them is probe. We study some characteristics of probe interval graph respect to the chordality. We also study an algorithm for recognizing probe interval graph, called md-pq tree.