Results 51 to 60 of about 61,399 (161)

Permutations in Binary Trees and Split Trees.

, 2018
We investigate the number of permutations that occur in random node labellings of trees. This is a generalisation of the number of subpermutations occuring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees [Cai et al., 2017].
Michael Albert 0001, Cecilia Holmgren, Tony Johansson, Fiona Skerman   +3 more
openaire   +3 more sources

Integer Partitions and Binary Trees

Advances in Applied Mathematics, 2002
If \(\alpha\) is the 2-core, \((\beta_0,\beta_1)\) the 2-quotient of a partition \(\lambda\), then the triple \((\alpha; \beta_0,\beta_1)\) uniquely determines \(\lambda\); see \textit{G. James} and \textit{A. Kerber} [The representation theory of the symmetric group (Addison-Wesley, Reading, MA) (1981; Zbl 0491.20010)]. The present author constructs a
openaire   +2 more sources

A Linear-Time Approximation Algorithm for Rotation Distance

Journal of Graph Algorithms and Applications, 2010
Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance.
Sean Cleary, Katherine St. John
doaj   +1 more source

Enumeration of binary trees compatible with a perfect phylogeny. [PDF]

J Math Biol, 2022
Palacios JA, Bhaskar A, Disanto F, Rosenberg NA.   +3 more
europepmc   +1 more source

Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees

Sensors, 2015
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood ...
Wan-Yu Chang, Chung-Cheng Chiu, Jia-Horng Yang   +2 more
doaj   +1 more source

Association testing for binary trees-A Markov branching process approach. [PDF]

Stat Med, 2022
Wu X, Zhu H.
europepmc   +1 more source

Quantifying Mosaic Development: Towards an Evo-Devo Postmodern Synthesis of the Evolution of Development via Differentiation Trees of Embryos

Biology, 2016
Embryonic development proceeds through a series of differentiation events. The mosaic version of this process (binary cell divisions) can be analyzed by comparing early development of Ciona intestinalis and Caenorhabditis elegans.
Bradly Alicea, Richard Gordon
doaj   +1 more source

An example related to Whitney’s extension problem for L 2,p (R2) when 1 < p < 2

Advanced Nonlinear Studies
In this paper, we prove the existence of a bounded linear extension operator T:L2,p(E)→L2,p(R2) $T:{L}^{2,p}\left(E\right)\to {L}^{2,p}\left({\mathbb{R}}^{2}\right)$ when 1 < p < 2, where E⊂R2 $E\subset {\mathbb{R}}^{2}$ is a certain discrete set with ...
Carruth Jacob, Israel Arie
doaj   +1 more source

Slim sets of binary trees

Journal of Combinatorial Theory, Series A, 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 $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible and $T$ displays $\cP$.
openaire   +2 more sources

On $n$-equivalence of binary trees.

Notre Dame Journal of Formal Logic, 1987
The paper contains a simple characterization of the binary trees which satisfy the same first-order sentences of quantifier depth n as the binary tree with one root whose branches all have length m (for all n and m). It follows immediately that, e.g., ``finiteness'' is not a first- order property of binary trees. The proof employs the Ehrenfeucht game.
openaire   +2 more sources