Steps

• Matching: input is 1 pattern & 1 str;output is “yes”/“no” (deterministic pattern) or score (probabilistic pattern).

• Discovery: find patterns matching some/all of input structures (choose patterns with high as possible fitness value to input structures)

• Comparison: input pair of structure descriptions (or description/pattern pair), find (local/global) similarities, optimise similarity measure, output score.

  • Similarity may be represented as a pattern

Previous slide

Next slide

Back to first slide

View graphic version