Searching for seed matches
Different searching methods are used:
Straightforward search, when each seed match consists of only one pair
Geometric hashing, elements in seed matches constraint to lie within (small) spheres
…
Previous slide
Next slide
Back to first slide
View graphic version