Substructure similarity search in graph databases
- 14 June 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 24, 766-777
- https://doi.org/10.1145/1066157.1066244
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- RASCAL: Calculation of Graph Similarity using Maximum Common Edge SubgraphsThe Computer Journal, 2002
- Efficient matching and indexing of graph models in content-based retrievalIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- KEGG: Kyoto Encyclopedia of Genes and GenomesNucleic Acids Research, 2000
- The Protein Data BankNucleic Acids Research, 2000
- Chemical Similarity SearchingJournal of Chemical Information and Computer Sciences, 1998
- A new algorithm for error-tolerant subgraph isomorphism detectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- Similarity searching in medical image databasesIEEE Transactions on Knowledge and Data Engineering, 1997
- A system for approximate tree matchingIEEE Transactions on Knowledge and Data Engineering, 1994
- Molecular substructure similarity searching: efficient retrieval in two-dimensional structure databasesJournal of Chemical Information and Computer Sciences, 1992
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992