Ordered and Unordered Tree Inclusion
From MaRDI portal
Publication:4834384
DOI10.1137/S0097539791218202zbMath0827.68050OpenAlexW2094034674MaRDI QIDQ4834384
Pekka Kilpeläinen, Heikki Mannila
Publication date: 30 May 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539791218202
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (42)
On the computational complexity of 2-interval pattern matching problems ⋮ Tree inclusions in windows and slices ⋮ A new tree inclusion algorithm ⋮ Generalized LCS ⋮ On Chen and Chen's new tree inclusion algorithm ⋮ Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees ⋮ A metric normalization of tree edit distance ⋮ Simulation relations for pattern matching in directed graphs ⋮ Satisfiability of Constraint Specifications on XML Documents ⋮ A survey on tree matching and XML retrieval ⋮ Exact algorithms for computing the tree edit distance between unordered trees ⋮ Fast arc-annotated subsequence matching in linear space ⋮ Tree inclusion problems ⋮ Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism ⋮ Efficient exponential-time algorithms for edit distance between unordered trees ⋮ Subgraph isomorphism in graph classes ⋮ New dissimilarity measure for recognizing noisy subsequence trees ⋮ Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism ⋮ A top down algorithm for constrained tree inclusion ⋮ Mining rooted ordered trees under subtree homeomorphism ⋮ On retracts, absolute retracts, and foldings in cographs ⋮ Algorithms for finding a most similar subforest ⋮ Finding common structured patterns in linear graphs ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Structural properties of XPath fragments ⋮ A survey on tree edit distance and related problems ⋮ Data mining in an engineering design environment: OR applications from graph matching ⋮ Comparing trees via crossing minimization ⋮ Unnamed Item ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees ⋮ Computational aspects of mining maximal frequent patterns ⋮ Weak Inclusion for XML Types ⋮ New and improved algorithms for unordered tree inclusion ⋮ Approximate labelled subtree homeomorphism ⋮ A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. ⋮ Matching subsequences in trees ⋮ Multi-subsequence searching ⋮ Constrained tree inclusion ⋮ FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT ⋮ On the complexity of finding a largest common subtree of bounded degree ⋮ Some MAX SNP-hard results concerning unordered labeled trees ⋮ Comparing and distinguishing the structure of biological branching
This page was built for publication: Ordered and Unordered Tree Inclusion
