A hyperstring is a simple semi-Hamiltonian acyclic digraph (V, E) with a labeling of the edges in E such that, for all vertices i, j, p, q element V, either π(i, j) = π(p, q) or π(i, j) intersection π(p, q) = ∅, where a set π(v_1, v_2) is the set of label strings represented by the paths (v_1, ..., v_2).

acyclic digraph | transparallel processing