Patterns in trees

DOI10.1016/0166-218X(89)90003-6zbMath0725.05034MaRDI QIDQ2277475

Nachum Dershowitz, Shmuel Zaks

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumerationpatternordered tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items

Uniform generation of a Schröder tree ⋮ Uniform generation of a Motzkin word ⋮ A parallel algorithm for the generation of a permutation and applications ⋮ A refinement of leaves on noncrossing trees ⋮ Moments of permutation statistics and central limit theorems ⋮ A linear-time algorithm for the generation of trees ⋮ Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm ⋮ The Distribution of Patterns in Random Trees ⋮ Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cycle lemma and some applications
• A combinatorial proof of the multivariable Lagrange inversion formula
• Enumerations of ordered trees
• Enumeration of plane trees by branches and endpoints
• Restricted plane tree representations of four Motzkin-Catalan equations
• A simple proof of a formula of Dershowitz and Zaks
• A problem of arrangements
• A transformation on ordered trees
• Analysis of algorithms on threaded trees
• Generating Binary Trees Lexicographically
• On the Altitude of Nodes in Random Trees
• Functional Composition Patterns and Power Series Reversion
• Correspondences between plane trees and binary sequences
• The number of plane trees
• The Number of Planted Plane Trees with a Given Partition
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products