Patterns and pattern-matching in trees: An analysis
From MaRDI portal
Recommendations
Cited in
(37)- scientific article; zbMATH DE number 1881087 (Why is no real title available?)
- Tree pattern matching with a more general notion of occurrence of the pattern.
- A complexity calculus for recursive tree algorithms
- Patterns with Bounded Treewidth
- scientific article; zbMATH DE number 7561480 (Why is no real title available?)
- On the number of induced subgraphs of trees
- Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
- Complexity of matching problems
- scientific article; zbMATH DE number 3854413 (Why is no real title available?)
- The asymptotic behaviour of coefficients of powers of certain generating functions
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- On the asymptotic normality in the problem on the tuples repetitions in a marked complete tree
- On sets of integers with prescribed gaps
- Complexity analysis of term-rewriting systems
- On an asymptotic method in enumeration
- The Distribution of Patterns in Random Trees
- Finding tree patterns consistent with positive and negative examples using queries
- scientific article; zbMATH DE number 4060735 (Why is no real title available?)
- On coincidences of tuples in a binary tree with random labels of vertices
- Undesignable motifs in structural RNAs and combinatorial consequences
- scientific article; zbMATH DE number 4058881 (Why is no real title available?)
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- Backward linearised tree pattern matching
- Supertrees
- Pattern avoidance in binary trees
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
- TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
- Local limit approximations for Lagrangian distributions
- Asymptotic normality of number of multiple coincidences of chains in complete q-ary trees and forests with randomly marked vertices
- Average-case analysis of pattern-matching in trees under the BST probability model
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- Rooted forests that avoid sets of permutations
- Some results on the asymptotic behaviour of coefficients of large powers of functions
- scientific article; zbMATH DE number 3883604 (Why is no real title available?)
- Noncontiguous pattern containment in binary trees
- Analytic analysis of algorithms
- scientific article; zbMATH DE number 4053042 (Why is no real title available?)
This page was built for publication: Patterns and pattern-matching in trees: An analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683556)
