Results 261 to 270 of about 2,921,645 (302)

Machine learning integrating immune-related cells, immunoglobulins, and immuno-inflammatory markers identifies risk factors for pulmonary comorbidities in ankylosing spondylitis: stratified analyses by chronic obstructive pulmonary disease and pulmonary nodules. [PDF]

Front Immunol
Ji S, Ping J, Cheng L, Zhang T, Huang Z, Wang L, Cheng C, Zhang X.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Random Binary Trees

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

Randomized search trees

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

On random cartesian trees

Random Structures & Algorithms, 1994
AbstractCartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the search key and the priority key are independent, and the trees is built based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees.
openaire   +1 more source

On the profile of random trees

Random Structures and Algorithms, 1997
Summary: Let \(T\) be a plane rooted tree with \(n\) nodes which is regarded as family tree of a Galton-Watson branching process conditioned on the total progeny. The profile of the tree may be described by the number of nodes or the number of leaves in layer \(t\sqrt n\), respectively.
Michael Drmota, Bernhard Gittenberger
openaire   +3 more sources

On the Contour of Random Trees

SIAM Journal on Discrete Mathematics, 1999
The author considers two sequences defined for trees from a simply generated family of rooted trees: the sequence of heights of the terminal nodes of the tree, proceeding from left to right; and the sequence of heights of the nodes encountered in a pre-order traversal of the tree.
openaire   +2 more sources

Random trees and random graphs

Random Structures and Algorithms, 1998
Summary: We study the asymptotic behavior of the number of trees with \(n\) vertices and diameter \(k= k(n)\), where \((n- k)/n\to a\) as \(n\to\infty\) for some constant \(a< 1\). We use this result to determine the limit distribution of the diameter of the random graph \(G(n,p)\) in the subcritical phase.
openaire   +3 more sources

Random spanning tree

Journal of Algorithms, 1983
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire   +1 more source

Dimensions of random trees

Statistics & Probability Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konsowa, Mokhtar H., Oraby, Tamer F.
openaire   +2 more sources

CONDUCTIVITY OF RANDOM TREES

Probability in the Engineering and Informational Sciences, 2002
We prove that the effective resistances of spherically symmetric random trees dominate in mean the effective resistances of random trees corresponding branching processes in varying environments and having the same growth law of spherically symmetric trees.
openaire   +2 more sources