Results 71 to 80 of about 68,741 (157)
Non-Contiguous Pattern Avoidance in Binary Trees
, 2011 We consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by modifying a known algorithm that counts binary trees avoiding a single contiguous tree pattern.
Wynn, Casey +2 more
core
, 2012 A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree T that contains all information of a given collection P of phylogenetic trees. If the answer is “yes” we say that P is compatible and T displays P.
Grünewald, Stefan, Stefan Grünewald
core +1 more source
On Defining Functions on Binary Trees 1
, 2008 Summary. This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars.
Piotr Rudnicki, Grzegorz Bancerek
core
Subtree transfer operations and their induced metrics on evolutionary trees [PDF]
, 1999 Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology. In this setting, extant species label the leaves of the tree, while the internal vertices correspond to ancestral species. Various techniques exist for
Steel, Mike, Allen, Benjamin Lang
core
Onk-Dimensional Balanced Binary Trees
, 1996 An amortized analysis of the insertion and deletion algorithms ofk-dimensional balanced binary trees (kBB-trees) is performed. It is shown that the total rebalancing time for a mixed sequence ofminsertions and deletions in akBB-tree of sizenisO(k(m+n ...
Vijay K. Vaishnavi, Vaishnavi, Vijay K.
core +1 more source
Iterative Formulas for Enumerating Binary Trees
, 1997 Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this paper, we give our solutions by iterative formulas for
牛島, 和夫 +2 more
core
2-Binary trees: Bijections and related issues
, 2008 A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary ...
Gu, Nancy S.S. +2 more
core +1 more source
Optimal Binary Split Trees Revisited
, 1994 Binary split trees were designed for static data sets and algorithms to construct optimal binary split trees have received some attention in the literature.
David A. Spuler, D. A. Spuler
core
Communications in Binary Fat Trees
, 1995 Fat trees are built around complete b-ary trees but have processing nodes only at the leaf level and may have different branch capacities in different levels. In this paper we study the communication capabilities of binary fat trees (including the simple
Nikitas J. Dimopoulos +1 more
core
Comparison of various in-order iterator implementations in C++
Open Computer ScienceData structures typically use sequential or hierarchical arrangements of elements. Hierarchical data structures are commonly referred to as trees. Trees can be implemented and applied in various ways from simple to relatively sophisticated structures ...
Mrena Michal +3 more
doaj +1 more source