The algorithm for substructure search in combinatorial libraries improves on existing al- There are a number of key advantages over alternative algorithms: (i) no constraints on how the synthons can be assembled, (ii) no internal parameters that have to be chosen, the only optional parameter is a stop criterion preventing excessive enumeration of search results