Abstract

A neuronal tree is a rooted tree with n leaves whose each internal node has at least two children; this class not only is defined based on the structure of dendrites in neurons, but also refers to phylogenetic trees or evolutionary trees. More precisely, neuronal trees are rooted-multistate phylogenetic trees whose size is defined as the number of leaves. In this paper, a new encoding over an alphabet of size 3 (minimal cardinality) is introduced for representing the neuronal trees with a given number of leaves. This encoding is used for generating neuronal trees with n leaves in A-order with constant average time and O(n) time complexity in the worst case. Also, new ranking and unranking algorithms are presented in time complexity of O(n) and O(n łog n), respectively.

Keywords

MSC

05C05, 05C85, 68R10

Cite this article

@article{cai-111257,
  author  = {Mahdi Amani and Abbas Nowzari-Dalini and Hayedeh Ahrabian},
  title   = {Generation of Neuronal Trees by a New Three Letters Encoding},
  journal = {Computing and Informatics},
  volume  = {33},
  number  = {6},
  pages   = {1428--1450},
  year    = {2014},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2014/6/generation-of-neuronal-trees-by-a-new-three-letters-encoding/}
}
Download .bib