A bijection between phylogenetic trees and plane oriented recursive trees

2017/09/18 by Helmut Prodinger, Prodinger, Helmut
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Constraint Satisfaction and Optimization #FOS: Mathematics #Stochastic processes and statistical mechanics #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.1709.05966

openalex publication_date 2017/09/18 · openalex created_date 2022/08/28 · openalex updated_date 2026/07/28

Abstract

Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.

Related

• Five Equivalent Representations of a Phylogenetic Tree
• Brauer and partition diagram models for phylogenetic trees and forests
• Which phylogenetic networks are merely trees with additional arcs?
• Phylogenetic trees and Euclidean embeddings
• Phylogenetic trees defined by at most three characters