Initialize the alignement before using it, with some ontology caching trick
//@deprecated The OntologyCache is now internal, use init( onto1, onto2 ) instead
A new alignment is created such that for
any pair (o, o', n, r) in O the resulting alignment will contain:
( o', o, n, inverse(r)) iff compose(r) exists.
Iterate on each subdirectory
Returns a vector[ each algo ] of vector [ each point ]
The points are computed by aggregating the values
(and in the end computing the average)