Pattern Matching in Trees
From MaRDI portal
Cited in
(69)- A survey on tree matching and XML retrieval
- Tree pattern matching with a more general notion of occurrence of the pattern.
- More efficient left-to-right matching for overlapping pattern
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Tree template matching in unranked ordered trees
- A sheaf-theoretic approach to pattern matching and related problems
- More efficient bottom-up multi-pattern matching in trees
- Efficient tree pattern unification
- Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
- Encompassment properties and automata with constraints
- Optimal parallel algorithms for forest and term matching
- Using multiset discrimination to solve language processing problems without hashing
- A set automaton to locate all pattern matches in a term
- Tree inclusions in windows and slices
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
- Structural properties of XPath fragments
- Complexity of matching problems
- A survey on tree edit distance and related problems
- Edit distance between unrooted trees in cubic time
- An efficient algorithm for some tree matching problems
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- A new algorithm for linear regular tree pattern matching
- TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
- Arbology: trees and pushdown automata
- Tree pattern matching from regular tree expressions.
- Classes of equational programs that compile into efficient machine code
- On the asymptotic normality in the problem on the tuples repetitions in a marked complete tree
- Implementation of an interpreter for abstract equations
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- Computing longest common subsequence under Cartesian-tree matching model
- Formal verification based on Boolean expression diagrams
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- From searching text to querying XML streams
- On the subtree isomorphism problem for ordered trees
- Tree automata for code selection
- On coincidences of tuples in a binary tree with random labels of vertices
- Combinatorial generation via permutation languages. VI: Binary trees
- On regular tree languages and deterministic pushdown automata
- Subsequence matching and LCS under Cartesian-tree equivalence
- Tree template matching in ranked ordered trees by pushdown automata
- On finding common subtrees
- Tree template matching in ranked ordered trees by pushdown automata
- State complexity of regular tree languages for tree matching
- Data mining in an engineering design environment: OR applications from graph matching
- The inference of tree languages from finite samples: An algebraic approach
- Strings, trees, and patterns
- Parallel tree pattern matching
- Code selection by inversion of order-sorted derivors
- A metric normalization of tree edit distance
- Linear matching-time algorithm for the directed graph isomorphism problem
- Automata-driven efficient subterm unification
- Simple tree pattern matching for trees in the prefix bar notation
- Left-to-right tree pattern matching
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
- TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
- Forward linearised tree pattern matching using tree pattern border array
- Asymptotic normality of number of multiple coincidences of chains in complete q-ary trees and forests with randomly marked vertices
- Efficient preprocessing of simple binary pattern forests
- A note on the subtree isomorphism for ordered trees and related problems
- On the Cooperative Graph Searching Problem
- Incremental techniques for efficient normalization of nonlinear rewrite systems
- A compiler for nondeterministic term rewriting systems
- Average-case analysis of pattern-matching in trees under the BST probability model
- On the hardness of computing the edit distance of shallow trees
- PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
- Generating tables for bottom-up matching
- Pattern matching in trees and nets
- On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching
- Distributive -calculus
This page was built for publication: Pattern Matching in Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933760)
