Patterns in trees
From MaRDI portal
Publication:2277475
In the paper a notion of pattern is defined. The pattern is like an ordered tree. The authors give exact formulae for the enumeration of occurrences of patterns in ordered, binary, and t-ary trees. Many well- known results for these classes of trees are obtained by using the above mentioned formulae.
Recommendations
Cites work
- A combinatorial proof of the multivariable Lagrange inversion formula
- A problem of arrangements
- A simple proof of a formula of Dershowitz and Zaks
- A transformation on ordered trees
- Analysis of algorithms on threaded trees
- Correspondences between plane trees and binary sequences
- Enumeration of plane trees by branches and endpoints
- Enumerations of ordered trees
- Functional Composition Patterns and Power Series Reversion
- Generating Binary Trees Lexicographically
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3694604 (Why is no real title available?)
- scientific article; zbMATH DE number 3723873 (Why is no real title available?)
- scientific article; zbMATH DE number 3780575 (Why is no real title available?)
- scientific article; zbMATH DE number 3494429 (Why is no real title available?)
- scientific article; zbMATH DE number 3526674 (Why is no real title available?)
- scientific article; zbMATH DE number 3205162 (Why is no real title available?)
- scientific article; zbMATH DE number 3270295 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3086778 (Why is no real title available?)
- On the Altitude of Nodes in Random Trees
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Restricted plane tree representations of four Motzkin-Catalan equations
- The cycle lemma and some applications
- The number of plane trees
- The Number of Planted Plane Trees with a Given Partition
Cited in
(22)- Uniform generation of a Motzkin word
- A parallel algorithm for the generation of a permutation and applications
- Description trees and Tutte formulas.
- A refinement of leaves on noncrossing trees
- Classical and consecutive pattern avoidance in rooted forests
- Tree series and pattern avoidance in syntax trees
- Patterns in treeshelves
- Uniform generation of a Schröder tree
- Nonleaf patterns in trees: protected nodes and fine numbers
- scientific article; zbMATH DE number 3871389 (Why is no real title available?)
- Leaf Pairs and Tree Dissections
- scientific article; zbMATH DE number 1088282 (Why is no real title available?)
- Expressions of pattern sequences
- More patterns in trees: up and down, young and old, odd and even
- Pattern avoidance in ternary trees
- The Distribution of Patterns in Random Trees
- Moments of permutation statistics and central limit theorems
- Plane trivalent trees and their patterns
- 0-1 laws for pattern occurrences in phylogenetic trees and networks
- A linear-time algorithm for the generation of trees
- Trees and extensive forms
- Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm
This page was built for publication: Patterns in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277475)
