Algorithmics of Atom-Atom Mapping
Maximum Common Substructure Algorithms
- ComplexityAt least as complex as substructure matching=> NP-complete=> intractable.However, it is important=> try it anyway.
- Approaches
- Brute Force
- Backtracking
- Dynamic Programming
- Genetic Algorithm
- Approximate solutions.