Sciweavers

40 search results - page 2 / 8
» Faster subtree isomorphism
Sort
View
APN
2008
Springer
13 years 7 months ago
Faster Unfolding of General Petri Nets Based on Token Flows
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
Robin Bergenthum, Robert Lorenz, Sebastian Mauser
IPL
2008
114views more  IPL 2008»
13 years 5 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur
DAWAK
2004
Springer
13 years 10 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
13 years 12 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
DLT
2008
13 years 6 months ago
Tree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison