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.
Previous slide
Next slide
Back to first slide
View graphic version