  In this note we consider a new variant of network of splicing processors
which simplifies the general model such that filters remain associated with
nodes but the input and output filters of every node coincide. This variant is
called {\it network of uniform splicing processors}. Although the communication
in the new variant seems less powerful, being based on simpler filters, the new
variant is sufficiently powerful to be computationally complete. The main
result is that nondeterministic Turing machines can be simulated by networks of
uniform splicing processors. Furthermore, the simulation is time efficient.
