55 search results - page 1 / 11 » Graph Pattern Matching: From Intractable to Polynomial Time |
PVLDB
2010
13 years 3 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
IPL
2010
13 years 3 months ago
2010
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
WABI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...