Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Maximum common subgraph isomorphism

Raymond JW, Willett P. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J Comput-Aided Mol Des 2002 16 521-33. [Pg.205]

Maximum common subgraph isomorphism algorithms are used to locate the largest common part that two strnctnres have in common. These algorithms are nsed to find similar strnctnres. [Pg.65]

Maximum Common Subgraph Isomorphism is a method from mathematical graph theory used to locate the largest part that two structures have in common to find similar structures. [Pg.114]

See other pages where Maximum common subgraph isomorphism is mentioned: [Pg.155]    [Pg.155]    [Pg.398]    [Pg.226]   
See also in sourсe #XX -- [ Pg.65 , Pg.114 ]



SEARCH



Isomorphic

Isomorphism

Isomorphism subgraph

Isomorphous

Isomorphs

Maximum common subgraph

Subgraph

Subgraphs

Subgraphs Common

Subgraphs Isomorphism

© 2024 chempedia.info