Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ISAAC

2004

Springer

2004

Springer

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 MPQ-tree can be constructed from a given interval probe graph in O(n2 +m) time. Thus we can solve the graph isomorphism problem for the interval probe graphs in O(n2 + m) 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 ﬁnd the best nonprobe that would be probed in the next experiment. Also, we can enumerate all possible aﬃrmative interval graphs for any i...

Related Content

Added |
02 Jul 2010 |

Updated |
02 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
ISAAC |

Authors |
Ryuhei Uehara |

Comments (0)