Ordered and Unordered Tree Inclusion
From MaRDI portal
Publication:4834384
DOI10.1137/S0097539791218202zbMath0827.68050MaRDI QIDQ4834384
Heikki Mannila, Pekka Kilpeläinen
Publication date: 30 May 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Structural properties of XPath fragments, A survey on tree edit distance and related problems, Tree inclusions in windows and slices, A new tree inclusion algorithm, Finding common structured patterns in linear graphs, Comparing trees via crossing minimization, Approximate labelled subtree homeomorphism, Matching subsequences in trees, Some MAX SNP-hard results concerning unordered labeled trees, Multi-subsequence searching, On the computational complexity of 2-interval pattern matching problems, Generalized LCS, On Chen and Chen's new tree inclusion algorithm, XRules: an effective algorithm for structural classification of XML data, Data mining in an engineering design environment: OR applications from graph matching, An algebraic view of the relation between largest common subtrees and smallest common supertrees, Computational aspects of mining maximal frequent patterns, Constrained tree inclusion, Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees, Tree inclusion problems
