© 2002 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
1 Pfizer Global Research and Development, Ann Arbor Laboratories, 2800 Plymouth Road, Ann Arbor, Michigan 48105, USA Email: john.raymond@pfizer.com 2 Krebs Institute for Biomolecular Research and Department of Information Studies, University of Sheffield, Western Bank, Sheffield S10 2TN, UK
A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs to exceed the minimum threshold, followed by a rigorous maximum common edge subgraph (MCES) detection algorithm to compute the exact degree and composition of similarity. The proposed MCES algorithm is based on a maximum clique formulation of the problem and is a significant improvement over other published algorithms. It presents new approaches to both lower and upper bounding as well as vertex selection.
Received 16 August, 2001. Revised 29 April, 2002.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
N. Bishop, V. J. Gillet, J. D. Holliday, and P. Willett Chemoinformatics Research at the University of Sheffield: A History and Citation Analysis Journal of Information Science, August 1, 2003; 29(4): 249 - 267. [Abstract] [PDF] |
||||
