Dependence-free clustering of shift-invariant data structures

Abstract

Dependence-free clustering of data structures can be regarded as a general form of alignment and addresses the problem of finding the maximum amount of independent computation on non-connected data sets. The paper presents a unified concept for modelling both data spaces and affine dependence relations with the help of Abelian subgroups of Zn. This approach allows us to treat alignment at a very high level of abstraction exploiting results of computational algebra.