𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

✍ Scribed by John W. Raymond; Peter Willett

Book ID
110406433
Publisher
Springer Netherlands
Year
2002
Tongue
English
Weight
152 KB
Volume
16
Category
Article
ISSN
0920-654X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithm for finding one of the largest
Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures
✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr

The Determination of Maximum Common Subs
The Determination of Maximum Common Substructures by a Genetic Algorithm: Application in Synthesis Design and for the Structural Analysis of Biological Activity
✍ Dr. Markus Wagener; Prof. Dr. Johann Gasteiger πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 483 KB πŸ‘ 3 views

## COMMUNICATIONS stability of the p2-bridged ketenylidene ligand characterized by a strong IR stretching band in the same region as that of terminal metal-coordinated carbonyl groups suggest that metal surfaces or reduced metal oxides may lead more frequently than originally thought to surface-co