Results 21 to 30 of about 1,259,069 (138)
On trees, tanglegrams, and tangled chains [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Tanglegrams are a class of graphs arising in computer science and in biological research on cospeciation and coevolution. They are formed by identifying the leaves of two rooted binary trees. The embedding of the trees in the plane is irrelevant for this
Sara Billey +2 more
doaj +1 more source
The # product in combinatorial Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We show that the # product of binary trees introduced by Aval and Viennot (2008) is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.
Jean-Christophe Aval +2 more
doaj +1 more source
Binary Trees for Dependence Structure
IEEE Access, 2020 In a data set with many categorical variables and several continuous valuables, the relationship between continuous random variables may differ from category to category for a given categorical variable.
Qingsong Shan, Qianning Liu
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2011 In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux.
Jean-Christophe Aval +2 more
doaj +1 more source
New Hopf Structures on Binary Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +2 more
doaj +1 more source
Left and right length of paths in binary trees or on a question of Knuth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$.
Alois Panholzer
doaj +1 more source
Decision Trees for Binary Subword-Closed Languages
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +1 more source
Efficient implementation of lazy suffix trees [PDF]
, 2003 Giegerich R, Kurtz S, Stoye J. Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE. 2003;33(11):1035-1049.We present an efficient implementation of a write-only top-down construction for suffix trees.
Stoye, Jens ; https://orcid.org/ +2 more
core +1 more source
Implicit inequality constraints in a binary tree model [PDF]
, 2011 In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves.
Zwiernik, Piotr +3 more
core +1 more source
The height of q-Binary Search Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.
Michael Drmota, Helmut Prodinger
doaj +3 more sources