Finding approximate patterns in undirected acyclic graphs

Jason T L Wang, Kaizhong Zhang, George Chang, Dennis Shasha

Research output: Contribution to journalArticle

Abstract

We consider an approximate pattern matching problem for undirected acyclic graphs. Specifically, let P be a pattern graph, D a data graph and t an integer. We present an algorithm to locate a subgraph in D whose distance from P is at most t. The distance measure used here is the degree-2 metric published previously. The time complexity of our algorithm is O(N pN Dd √d log d) where N p and N D are the number of nodes in P and D, respectively; d = min d P,d D; d p and d D are the maximum degree of P and D, respectively. Central to our algorithm is a procedure for finding approximate patterns in rooted unordered trees and freely allowing cuts. We discuss two applications of the algorithms in chemical information search and website management on the Internet.

Original languageEnglish (US)
Pages (from-to)473-483
Number of pages11
JournalPattern Recognition
Volume35
Issue number2
DOIs
StatePublished - Feb 2002

Fingerprint

Pattern matching
Websites
Internet

Keywords

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

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Finding approximate patterns in undirected acyclic graphs. / Wang, Jason T L; Zhang, Kaizhong; Chang, George; Shasha, Dennis.

In: Pattern Recognition, Vol. 35, No. 2, 02.2002, p. 473-483.

Research output: Contribution to journalArticle

Wang, Jason T L ; Zhang, Kaizhong ; Chang, George ; Shasha, Dennis. / Finding approximate patterns in undirected acyclic graphs. In: Pattern Recognition. 2002 ; Vol. 35, No. 2. pp. 473-483.
@article{421252f21bec4df2b08f060253fbf0f6,
title = "Finding approximate patterns in undirected acyclic graphs",
abstract = "We consider an approximate pattern matching problem for undirected acyclic graphs. Specifically, let P be a pattern graph, D a data graph and t an integer. We present an algorithm to locate a subgraph in D whose distance from P is at most t. The distance measure used here is the degree-2 metric published previously. The time complexity of our algorithm is O(N pN Dd √d log d) where N p and N D are the number of nodes in P and D, respectively; d = min d P,d D; d p and d D are the maximum degree of P and D, respectively. Central to our algorithm is a procedure for finding approximate patterns in rooted unordered trees and freely allowing cuts. We discuss two applications of the algorithms in chemical information search and website management on the Internet.",
keywords = "Chemical substructure search, Distance metric, Graph matching, Pattern discovery, Website analysis",
author = "Wang, {Jason T L} and Kaizhong Zhang and George Chang and Dennis Shasha",
year = "2002",
month = "2",
doi = "10.1016/S0031-3203(01)00055-3",
language = "English (US)",
volume = "35",
pages = "473--483",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - Finding approximate patterns in undirected acyclic graphs

AU - Wang, Jason T L

AU - Zhang, Kaizhong

AU - Chang, George

AU - Shasha, Dennis

PY - 2002/2

Y1 - 2002/2

N2 - We consider an approximate pattern matching problem for undirected acyclic graphs. Specifically, let P be a pattern graph, D a data graph and t an integer. We present an algorithm to locate a subgraph in D whose distance from P is at most t. The distance measure used here is the degree-2 metric published previously. The time complexity of our algorithm is O(N pN Dd √d log d) where N p and N D are the number of nodes in P and D, respectively; d = min d P,d D; d p and d D are the maximum degree of P and D, respectively. Central to our algorithm is a procedure for finding approximate patterns in rooted unordered trees and freely allowing cuts. We discuss two applications of the algorithms in chemical information search and website management on the Internet.

AB - We consider an approximate pattern matching problem for undirected acyclic graphs. Specifically, let P be a pattern graph, D a data graph and t an integer. We present an algorithm to locate a subgraph in D whose distance from P is at most t. The distance measure used here is the degree-2 metric published previously. The time complexity of our algorithm is O(N pN Dd √d log d) where N p and N D are the number of nodes in P and D, respectively; d = min d P,d D; d p and d D are the maximum degree of P and D, respectively. Central to our algorithm is a procedure for finding approximate patterns in rooted unordered trees and freely allowing cuts. We discuss two applications of the algorithms in chemical information search and website management on the Internet.

KW - Chemical substructure search

KW - Distance metric

KW - Graph matching

KW - Pattern discovery

KW - Website analysis

UR - http://www.scopus.com/inward/record.url?scp=0036466969&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036466969&partnerID=8YFLogxK

U2 - 10.1016/S0031-3203(01)00055-3

DO - 10.1016/S0031-3203(01)00055-3

M3 - Article

VL - 35

SP - 473

EP - 483

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 2

ER -