Results 61 to 70 of about 2,453,886 (301)
Broadcasting‐induced colorings of preferential attachment trees
, 2023 We consider random two-colorings of random linear preferential attachment trees, which includes recursive trees, plane-oriented recursive trees, binary search trees, and a class of d-ary trees.
Stephan Wagner +8 more
core +1 more source
Discrete Mathematics, 1983 The probability space consisting of all graphs on a set of \(n\) vertices where each edge occurs with probability \(p\), independently of all other edges, is denoted by \(G(n,p)\). Theorem: For each \(\epsilon>0\) almost every graph \(G\in G(n,p)\) is such if \((1+\epsilon)\log n/\log ...
Paul Erdös, Zbigniew Palka
openaire +2 more sources
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Random walk with barycentric self-interaction [PDF]
, 2011 We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory $(X_1,...,X_n)
Menshikov, Mikhail V. +3 more
core +4 more sources
Random hyperplane search trees in high dimensions
Journal of Computational Geometry, 2015 Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space
Luc Devroye, James King
doaj +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
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees
Applied Sciences, 2020 Predicting pillar stability in underground mines is a critical problem because the instability of the pillar can cause large-scale collapse hazards. To predict the pillar stability for underground coal and stone mines, two new models (random tree and C4 ...
Mahmood Ahmad +5 more
doaj +1 more source
Label-based parameters in increasing trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj +1 more source
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source