Complexity issues in vertex-colored graph pattern matching

Complexity issues in vertex-colored graph pattern matching

Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In the context of metabolic network analysis, Lacroix et al [V. Lacroix, C.G. Fernandes and M.-F. Sagot, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3 (2006), no. 4, 360368 ] introduced the NP-hard general problem of finding occurrences of motifs in vertexcolored graphs, wh...

Complexity Issues in Vertex-Colored Graph Pattern MatchingI,II

Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In the context of metabolic network analysis, Lacroix et al [V. Lacroix, C.G. Fernandes and M.-F. Sagot, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3 (2006), no. 4, 360368 ] introduced the NP-hard general problem of finding occurrences of motifs in vertexcolored graphs, wh...

Generalized Graph Pattern Matching

Graphs are high expressive models and especially suitable for modelling highly complex structures, the number of applications that use them for modelling both their data and the processes that manipulate has grown dramatically in recent years. The use of new conceptual structures in real-world applications requires the development of new systems to store and query such structures in order to al...

Incremental Graph Pattern Matching

Graph Pattern Matching in PROGRES

The work reported here is part of the PROGRES (PROgrammed Graph Rewriting Systems) project. PROGRES is a very high level multi paradigm language for the specification of complex structured data types and their operations. The data structures are modelled as directed, attributed, node and edge labeled graphs (diane graphs). The basic programming constructs of PROGRES are graph rewriting rules (p...