We propose and evaluate a mechanism for resolving the segmentation of overlapping chromosomes using trainable models of the expected banding appearance. The models consist of templates of sub-chromosome length band pro"les. Candidate chromosome segments are classi"ed according to their responses to the entire set of templates, and matched on the basis of the classi"cations. Evaluation of the mo...

The metric dimension of a graph Γ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph Gq(n,k) (whose vertices are the k-subspaces of Fq, and are adjacent if they intersect in a (k− 1)-subspace) for k ≥ 2. We find an upper bound on its metric dimension, which is ...

This papers’ aim is to provide the Artificial Intelligence community with a better tool for symbolic regression. In this paper, the method of analytical programming and constant resolving is revisited and extended. Nowadays, analytical programming mainly uses two methods for constant resolving. The first method is meta-evolution, in which the second evolutionary algorithm is used for constant r...

1. The existence of finite resolving systems. In an earlier paper we have announced the result that the existence of a resolving system of the Riemann manifold of an abstract field of algebraic functions (in any number of variables) or—what is the same—the local uniformization theorem implies the existence of finite resolving systems of the Riemann manifold. We have proved this result for algeb...