The philosophy
Find seed matches, i.e. sets of consistent pairs of compatible elements
- All elements in a seed match must be different
- An element may be in several seed matches
Group consistent seed matches iteratively into clusters, representing the (k) substructures with highest score
Optional refinement (often using the iteratively alternating superposition/alignment)