Displaying similar documents to “Continued fractions and Catalan problems.”

Edit distance between unlabeled ordered trees

Anne Micheli, Dominique Rossin (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern ) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...

Plane trivalent trees and their patterns

Charles Delorme (2010)

Open Mathematics

Similarity:

The aim of this paper is to characterize the patterns of successive distances of leaves in plane trivalent trees, and give a very short characterization of their parity pattern. Besides, we count how many trees satisfy some given sequences of patterns.