Results 261 to 270 of about 166,958 (306)
Geographical Authentication of <i>Aquilaria sinensis</i> Using Integrated C and O Stable Isotope Analysis Coupled with Chemometric Profiling. [PDF]
MoleculesZeng L +8 more
europepmc +1 more source
Assessing the inference of single-cell phylogenies and population dynamics from CRISPR lineage recordings. [PDF]
PLoS Comput BiolPilarski J, Stadler T, Seidel S.
europepmc +1 more source
RANDOM WALKS AND DIMENSIONS OF RANDOM TREES
Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2010 We study the relationship between the type of the random walk on some random trees and the structure of those trees in terms of fractal and resistance dimensions. This paper generalizes some results of Refs. 8–10.
MOKHTAR H. KONSOWA
openaire +2 more sources
Random Trees Are the Cornerstones of Natural Forests
Forests, 2021 Natural forests serve as the main component of the forest ecosystem. An in-depth interpretation of tree composition and structure of forest community is of great significance for natural forest conservation, monitoring, management, and near-natural ...
Gongqiao Zhang +2 more
exaly +2 more sources
Random trees have height O(n) [PDF]
Annals of ProbabilityWe obtain new nonasymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaymé trees (the family trees of branching processes) in the process settling three conjectures of ...
Louigi Addario-Berry +1 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematics of Operations Research, 1984
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire +2 more sources
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire +2 more sources
30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source