Results 81 to 90 of about 5,525,400 (353)
Random trees and applications [PDF]
Probability Surveys, 2005 We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the convergence in distribution of the contour process of conditioned Galton-Watson trees towards the normalized Brownian
openaire +5 more sources
Molecular Oncology, EarlyView.This study investigates gene expression differences between two major pediatric acute lymphoblastic leukemia (ALL) subtypes, B‐cell precursor ALL, and T‐cell ALL, using a data‐driven approach consisting of biostatistics and machine learning methods. Following analysis of a discovery dataset, we find a set of 14 expression markers differentiating the ...
Mona Nourbakhsh +8 more
wiley +1 more source
Journal of Computing and Information Technology, 2023 With the advancement of the university information process, more and more application systems are running on the campus network, and the information system becomes larger and more complex. With the rapid growth of network users and the popularization and
Li Yin, Yijun Chen
doaj +1 more source
Random trees constructed by aggregation [PDF]
, 2014 We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree.
N. Curien, Bénédicte Haas
semanticscholar +1 more source
Open Journal of Discrete Mathematics, 2014 We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly $k$-balanced for any $k\geq 3$.
Warren E. Shreve, Azer Akhmedov
openaire +4 more sources
Molecular Oncology, EarlyView.This study presents a novel AI‐based diagnostic approach—comprehensive serum glycopeptide spectra analysis (CSGSA)—that integrates tumor markers and enriched glycopeptides from serum. Using a neural network model, this method accurately distinguishes liver and pancreatic cancers from healthy individuals.
Motoyuki Kohjima +6 more
wiley +1 more source
Random walks on complex trees [PDF]
Physical Review E, 2008 We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the
Baronchelli, Andrea +2 more
openaire +6 more sources
Molecular Oncology, EarlyView.Single‐cell transcriptomics of prostate cancer patient‐derived xenografts reveals distinct features of neuroendocrine (NE) subtypes. Tumours with focal NE differentiation (NED) share transcriptional programmes with adenocarcinoma, differing from large and small cell neuroendocrine prostate cancer (NEPC). Our work defines the molecular landscape of NEPC,
Rosalia Quezada Urban +12 more
wiley +1 more source
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1971 AbstractThe problem is considered of determining the distribution of the number of nodes in any given component of a forest obtained by removing edges from a random tree.
openaire +3 more sources