In this paper we describe properties of the algorithm of identification of markers by statistical tests in a set of quantifying dependences with the occurrence of the tested phenomena's outlying behavior. There is a difficulty with very high volumes of computations as the flows from basic combinatorial reasoning.
The use of a Gnostic Solution appears as the most optimal one in the present-day state of science.