Patterns and pattern-matching in trees: An analysis
From MaRDI portal
Publication:3683556
DOI10.1016/S0019-9958(83)80056-4zbMath0567.68053MaRDI QIDQ3683556
Jean-Marc Steyaert, Philippe Flajolet
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)
Related Items
Local limit approximations for Lagrangian distributions ⋮ Some results on the asymptotic behaviour of coefficients of large powers of functions ⋮ On coincidences of tuples in a binary tree with random labels of vertices ⋮ Complexity of matching problems ⋮ On the number of induced subgraphs of trees ⋮ Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Supertrees ⋮ Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах ⋮ Rooted forests that avoid sets of permutations ⋮ Noncontiguous pattern containment in binary trees ⋮ The depth first processes of Galton-Watson trees converge to the same Brownian excursion ⋮ A complexity calculus for recursive tree algorithms ⋮ Average-case analysis of pattern-matching in trees under the BST probability model ⋮ On coincidences of tuples in a \(q\)-ary tree with random labels of vertices ⋮ Pattern avoidance in binary trees ⋮ The Distribution of Patterns in Random Trees ⋮ Analytic analysis of algorithms ⋮ Complexity analysis of term-rewriting systems ⋮ The asymptotic behaviour of coefficients of powers of certain generating functions ⋮ On an asymptotic method in enumeration ⋮ Unnamed Item ⋮ On sets of integers with prescribed gaps
