Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

Voted

JCAMD
2002

favoriteEmaildiscussreport

38views more JCAMD 2002»

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

13 years 7 months ago

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

Download www.comp.nus.edu.sg

John W. Raymond, Peter Willett 0002

Real-time Traffic

JCAMD 2002 |

claim paper

Related Content

» Challenging Complexity of Maximum Common Subgraph Detection Algorithms A Performance Analy...

» ClosureTree An Index Structure for Graph Queries

» Maximum common subgraph some upper bound and lower bound results

» Similarity Analysis of Protein Binding Sites A Generalization of the Maximum Common Subgra...

» Pattern Matching and Pattern Discovery Algorithms for Protein Topologies

» Counting Subgraphs via Homomorphisms

» Structural matching of 2D electrophoresis gels using deformed graphs

» GraphTheoretical Methods in Computer Vision

» Neighborhood based fast graph search in large networks

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JCAMD
Authors	John W. Raymond, Peter Willett 0002

Comments (0)