scientific article; zbMATH DE number 1335845

MaRDI QIDQ4258518zbMATH OpenFDO

Authors Peter K. Willett

Publication date 27 January 2000

zbMATH Keywords

ASSAMcarbohydrate sequencecomplex carbohydrate structureconnection tabledatabase searchingDISCfield-graphgraph-isomorphism algorithmsmaximal common subgraph isomorphismmolecular electrostatic potentialpharmacophore mappingpharmacophoric pattern matchingprotein data bankprotein structurePROTEP/similarity searchingsubgraph isomorphismsubstructure searching

Mathematics Subject Classification ID

Applications of graph theory (05C90) Database theory (68P15) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• scientific article; zbMATH DE number 4081609
• Maximum common subgraph isomorphism algorithms
• scientific article; zbMATH DE number 2239324
• scientific article; zbMATH DE number 2043361
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics

Cited in

(9)

• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
• Polyhedral study of the maximum common induced subgraph problem
• scientific article; zbMATH DE number 4081609 (Why is no real title available?)
• Similarity and Dissimilarity Methods for Processing Chemical Structure Databases
• Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
• Maximum common subgraph isomorphism algorithms
• Determining the Hausdorff distance between trees in polynomial time
• Logic versus Approximation
• scientific article; zbMATH DE number 2239324 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258518)