A polynomial time recognition algorithm for probe interval graphs

Authors:
Julie L. Johnson;Jeremy P. Spinrad
Affiliations:
Box 1679-B, EECS, Dept., Vanderbilt University, Nashville, TN;Box 1679-B, EECS, Dept., Vanderbilt University, Nashville, TN
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 3
Cited 18

On the 2-chain subgraph cover and related problems

Journal of Algorithms
On probe interval graphs

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets

Construction of probe interval models

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discovering temporal relations in molecular pathways using protein-protein interactions

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Two tricks to triangulate chordal probe graphs in polynomial time

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Chordal probe graphs

Discrete Applied Mathematics
2-tree probe interval graphs have a large obstruction set

Discrete Applied Mathematics - Special issue: Max-algebra
Partitioned probe comparability graphs

Theoretical Computer Science
Probe Ptolemaic Graphs

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A characterization of cycle-free unit probe interval graphs

Discrete Applied Mathematics
2-Tree probe interval graphs have a large obstruction set

Discrete Applied Mathematics
Characterisations and linear-time recognition of probe cographs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Adjacency matrices of probe interval graphs

Discrete Applied Mathematics
Recognition of probe cographs and partitioned probe distance hereditary graphs

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the recognition of probe graphs of some self-complementary classes of perfect graphs

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On probe permutation graphs

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The PIGs full monty – a floor show of minimal separators

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Canonical data structure for interval probe graphs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Recognition of probe distance-hereditary graphs

Discrete Applied Mathematics
Recognition of probe proper interval graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probe interval graphs were introduced to model a problem arising in a form of DNA sequencing. This paper presents an &Ogr;(n2) algorithm for recognizing probe interval graphs. This is the first polynomial time recognition algorithm for this class.