Results 1  10
of
2,994
On Probe Interval Graphs
, 2001
"... In this report, we first studied the characteristics of probe interval graphs. Then we analyzed an O(n³) algorithm, which recongnizes probe interval graphs and gives a possible solution. In addition, the algorithm was illustrated by two examples step by step. Based on our analysis, we provided a des ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
In this report, we first studied the characteristics of probe interval graphs. Then we analyzed an O(n³) algorithm, which recongnizes probe interval graphs and gives a possible solution. In addition, the algorithm was illustrated by two examples step by step. Based on our analysis, we provided a
Characterizations of probe interval graphs
, 2008
"... In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bipartite graph from its adjacency matrix. Finally, we note that if we add a loop at every probe ..."
Abstract
 Add to MetaCart
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bipartite graph from its adjacency matrix. Finally, we note that if we add a loop at every
Tagged Probe Interval Graphs
, 1998
"... A generalization of interval graph is introduced for cosmid contig mapping of DNA. A graph is a tagged probe interval graph if its vertex set can be partitioned into two subsets of probes and nonprobes, and a closed interval can be assigned to each vertex such that two vertices are adjacent if and o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A generalization of interval graph is introduced for cosmid contig mapping of DNA. A graph is a tagged probe interval graph if its vertex set can be partitioned into two subsets of probes and nonprobes, and a closed interval can be assigned to each vertex such that two vertices are adjacent
Canonical Data Structure for Probe Interval Graphs
, 2004
"... The class of probe interval 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 u ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The class of probe interval 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
LinearTime Recognition of Probe Interval Graphs
"... Abstract. The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where the intervals are partitioned into two sets: probes ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where the intervals are partitioned into two sets: probes
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
, 2003
"... A tree tspanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree tspanner problem asks whether a graph admits a tree tspanner, given t. We first substantially strengthen the known results for bip ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
, and that every convex graph has a tree 3spanner. We next focus on the tree tspanner problem for probe interval graphs and related graph classes. The graph classes were introduced to deal with the physical mapping of DNA. From a graph theoretical point of view, the classes are natural generalizations
Computing 2Terminal Reliability of Probe Interval Graphs
"... Copyright © 2014 ChaoChun Ting and MinSheng Lin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Consider a probabilistic graph G i ..."
Abstract
 Add to MetaCart
complete for general graphs but solvable in polynomial time for interval graphs. This work presents a polynomialtime algorithm for computing the 2terminal reliability of probe interval graphs, which is a superclass of interval graphs.
Recognizing edge clique graphs among interval graphs and probe interval graphs
 Applied Mathematics Letters
"... Abstract The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H . We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
clique graphs} ∩ {probe interval graphs}, which leads to polynomial time recognition algorithms for them.
Forbidden subgraph characterization of bipartite unit probe interval graphs
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 52 (2012), PAGES 19–31
, 2012
"... A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have
2tree probe interval graphs have a large obstruction set
, 2004
"... Probe interval graphs are used as a generalization of interval graphs in physical mapping of DNA. is a probe interval graph (PIG) with respect to a partition ¥���¨��� � of ¦ if vertices of ¢ correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding inter ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Probe interval graphs are used as a generalization of interval graphs in physical mapping of DNA. is a probe interval graph (PIG) with respect to a partition ¥���¨��� � of ¦ if vertices of ¢ correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding
Results 1  10
of
2,994