The GenPlexâ„¢ HID System (Applied Biosystems - AB) offers typing of 48 of the 52 SNPforID SNPs and amelogenin. Previous studies have shown a high reproducibility of the GenPlexâ„¢ HID System usingâ€¦ (More)

Reno is a proof of concept prototype produced by the Advanced User Interface Group of Microsoft. It illustrates the power and simplicity of object-orientation for the end user when applied completelyâ€¦ (More)

If D = (V,A) is a digraph, its competition hypergraph CH(D) has vertex set V and e âŠ† V is an edge of CH(D) iff |e| â‰¥ 2 and there is a vertex v âˆˆ V , such that e = {w âˆˆ V |(w, v) âˆˆ A}. Besides aâ€¦ (More)

A hypergraph H is a sum hypergraph i there are a nite S âŠ‚N+ and dmin ; dmax âˆˆ N with 1Â¡dmin6dmax such that H is isomorphic to the hypergraph Hdmin ;dmax (S)=(V;E) where V :=S and E:= { eâŠ† S:â€¦ (More)

A graph G is a difference graph iff there exists S âŠ‚ IN such that G is isomorphic to the graph DG(S) = (V,E), where V = S and E = {{i, j} : i, j âˆˆ V âˆ§ |iâˆ’ j| âˆˆ V }. It is known that trees, cycles,â€¦ (More)

Let G = (V,E) be a simple undirected graph. N(G) = (V,EN ) is the neighborhood graph of the graph G, if and only if EN = {{a, b} | a 6= b âˆ§ âˆƒx âˆˆ V : {x, a} âˆˆ E âˆ§ {x, b} âˆˆ E}. After discussing severalâ€¦ (More)

A digraph G is a difference digraph iff there exists an S âŠ‚ IN such that G is isomorphic to the digraph DD(S) = (V,A), where V = S and A = {(i, j) : i, j âˆˆ V âˆ§ iâˆ’ j âˆˆ V }. For some classes ofâ€¦ (More)