Pattern Matching with Binary Patterns

Patterns and other characteristics of RDF descriptors that seem to indicate unique features are not easy to determine. However, compiled carefully they are helpful tools for a quick recognition of substructures. A pattern search algorithm based on binary pattern descriptors can then be used for substructure search. 

Although binary pattern descriptors exclusively contain information about the presence or absence of distances, frequency pattern descriptors additionally contain the frequency of distances. Frequency pattern descriptors are valuable for direct comparison of structural similarities. For instance, a substructure can be assumed to exist if the frequencies in a substructure pattern occur in the query descriptor. Bond patterns can be used in a similar pattern search approach to determine structural similarities. In this case bond-path RDF descriptors are used. 

---

The method of binary template matching is equivalent to a learning network with n = 1. A binary template of a class is the superposition (Logical "and -function) of all binary encoded patterns of that class. 

---