About Fibonacci trees. I

04/27/2019
by   Maurice Margenstern, et al.
0

In this first paper, we look at the following question: are the properties of the Fibonacci tree still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties arise, a bit more complex than in the case of a tree rooted at a white node, but still of interest.

READ FULL TEXT

page 4

page 11

research
07/10/2019

About Fibonacci trees. II – generalized Fibonacci trees

In this second paper, we look at the following question: are the propert...
research
09/04/2019

About Fibonacci trees III: multiple Fibonacci trees

In this third paper, we revisit the question to which extent the propert...
research
05/09/2023

DeepTree: Modeling Trees with Situated Latents

In this paper, we propose DeepTree, a novel method for modeling trees ba...
research
02/08/2020

Node Templates to improve Reusability and Modularity of Behavior Trees

Behavior Trees (BTs) got the robotics society attention not least thanks...
research
01/26/2018

Information Content of a Phylogenetic Tree in a Data Matrix

Phylogenetic trees in genetics and biology in general are all binary. We...
research
04/28/2022

Clustering Systems of Phylogenetic Networks

Rooted acyclic graphs appear naturally when the phylogenetic relationshi...
research
05/28/2018

Non-bifurcating phylogenetic tree inference via the adaptive LASSO

Phylogenetic tree inference using deep DNA sequencing is reshaping our u...

Please sign up or login with your details

Forgot password? Click here to reset