Recommendations
Cited in
(59)- Approximate labelled subtree homeomorphism
- Matching subsequences in trees
- Computing on a free tree via complexity-preserving mappings
- On finding common subtrees
- Some MAX SNP-hard results concerning unordered labeled trees
- Multi-subsequence searching
- Mining rooted ordered trees under subtree homeomorphism
- On retracts, absolute retracts, and foldings in cographs
- On the computational complexity of 2-interval pattern matching problems
- New and improved algorithms for unordered tree inclusion
- On the complexity of finding a largest common subtree of bounded degree
- Comparing and distinguishing the structure of biological branching
- Generalized LCS
- On Chen and Chen's new tree inclusion algorithm
- Fast arc-annotated subsequence matching in linear space
- Efficient exponential-time algorithms for edit distance between unordered trees
- XRules: an effective algorithm for structural classification of XML data
- Data mining in an engineering design environment: OR applications from graph matching
- Ordered trees and the inorder traversal
- Approximate matching for two families of trees
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Computational aspects of mining maximal frequent patterns
- Constrained tree inclusion
- scientific article; zbMATH DE number 1638647 (Why is no real title available?)
- Satisfiability of Constraint Specifications on XML Documents
- New dissimilarity measure for recognizing noisy subsequence trees
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- On parsimonious explanations for 2-D tree- and linearly-ordered data
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Matching Subsequences in Trees
- Tree inclusion problems
- A metric normalization of tree edit distance
- Constrained tree inclusion
- Simulation relations for pattern matching in directed graphs
- A survey on tree matching and XML retrieval
- On Regular Tree Embeddings
- More Efficient Algorithm for Ordered Tree Inclusion
- scientific article; zbMATH DE number 1972679 (Why is no real title available?)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Subgraph isomorphism in graph classes
- scientific article; zbMATH DE number 1885197 (Why is no real title available?)
- scientific article; zbMATH DE number 826058 (Why is no real title available?)
- A top down algorithm for constrained tree inclusion
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- scientific article; zbMATH DE number 7561381 (Why is no real title available?)
- Weak inclusion for XML types
- Finding smallest supertrees under minor containment
- Algorithms for finding a most similar subforest
- Bottom-up subtree isomorphism for unordered labeled trees
- Structural properties of XPath fragments
- A survey on tree edit distance and related problems
- SOFSEM 2004: Theory and Practice of Computer Science
- Exact algorithms for computing the tree edit distance between unordered trees
- Dichotomies for tree minor containment with structural parameters
- Dichotomies for tree minor containment with structural parameters
- Tree inclusions in windows and slices
- A new tree inclusion algorithm
- Finding common structured patterns in linear graphs
- Comparing trees via crossing minimization
This page was built for publication: Ordered and Unordered Tree Inclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834384)
