Finding approximate patterns in undirected acyclic graphs

Pattern Recognition

Volumn 35, Issue 2, 2002, Pages 473-483

  Wang, Jason T L ^a   Zhang, Kaizhong ^b   Chang, George ^c   Shasha, Dennis ^d  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c KEAN UNIVERSITY   (United States)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

Chemical substructure search; Distance metric; Graph matching; Pattern discovery; Website analysis

Indexed keywords

GRAPHIC METHODS; INTERNET; WEBSITES;

SUBGRAPH;

PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 0036466969     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00055-3     Document Type: Article

References (30)

1. A new product graph based algorithm for subgraph isomorphism
2. A linear programing approach for the weighted graph matching problem
3. A subgraph isomorphism algorithm using resolution
4. An image understanding system using attributed symbolic representation and inexact graph-matching
5. A Hough transform technique for subgraph isomorphism
6. A new algorithm for error tolerant subgraph isomorphism detection
7. Structural descriptions and inexact matching
8. Exact and approximate algorithms for unordered tree matching
9. Neural-network approach for solving the maximal common subgraph problem
10. A metric between unrooted and unordered trees and its bottom-up computing method
11. Error-correcting isomorphisms of attributed relational graphs for pattern analysis
12. Finding approximate patterns in strings
13. Simple fast algorithms for the editing distance between trees and related problems
14. Substructure search system. 1. Performance comparison of the MACCS, DARC, HTSS, CAS registry MVSSS, and S4 substructure search systems
15. Matching two-dimensional chemical graphs using genetic algorithms
16. Fast similarity search in three-dimensional structure databases
17. On the editing distance between undirected acyclic graphs
18. Efficient implementation of graph algorithms using contraction
19. The string-to-string correction problem
20. An analysis of the general tree-editing problem
21. Faster scaling algorithms for network problems
22. Structure-based strategies for drug design and discovery
23. A system for approximate tree matching