We observe, that this computation on a single core would take less than a second. In B, we search for all structures containing the structure of G43 as a substructure, without any further constraints. Here, finding the 231 synthon sets that assemble superstructures of this compound again takes less than one second on a single core. In C, we keep the left hand side of the compound fixed and search for all extensions, and in D we keep the right hand side fixed and search for all substitutions of the Benzothiophene. In E, we search for all structures containing the Murcko scaffold and must be further substituted at the two indicated atoms. Computing the 48100 synthon sets that describe matching structures takes around ten seconds on a single core. In F, we illustrate wild card feature matching. We allow any combination of atoms and bonds in all ring structures. we observe an extreme drop in bits of the Fragment FP compared to the other considered structures, due to the fact that a wide variety of different structures can match this search pattern. The low number of Fragment FP bits illustrates that only very few specific substructure features can be deduced for this query. The reason why the search for C takes so long (3 seconds) for this rather simple query is due to the large number of substructure searches that have to be performed for the left hand side of the molecule and that are not filtered by the fingerprint filtering of fragments. This is, because for a large number of decompositions, only the single carbon atom outside of the fixed area has to be matched against all synthons, and therefore a large number of trivial substructure searches have to be performed that cannot be filtered out by fingerprint filtering.