Results 81 to 90 of about 2,453,886 (301)

Structural and biochemical insights into the thermostable esterase Ta0887 from Thermoplasma acidophilum

open access: yesFEBS Open Bio, EarlyView.
In this study, a novel esterase from the thermoacidophilic archaeon Thermoplasma acidophilum was biochemically and structurally characterized. Our results demonstrate that Ta0887 is a highly thermostable esterase that preferentially hydrolyzes p‐nitrophenyl hexanoate and possesses an α‐helical cap domain that likely contributes to its substrate ...
Alejandro Delgado‐Rey   +4 more
wiley   +1 more source

Random walks on trees

open access: yesDiscrete Mathematics, 1980
AbstractThe classical gambler's ruin problem, i.e., a random walk along a line may be viewed graph theoretically as a random walk along a path with the endpoints as absorbing states. This paper is an investigation of the natural generalization of this problem to that of a particle walking randomly on a tree with the endpoints as absorbing barriers ...
openaire   +2 more sources

A minimal cellulosome‐like system in Cellulosilyticum lentocellum

open access: yesFEBS Open Bio, EarlyView.
Cellulose‐degrading bacteria typically use cellulosomes, large multi‐enzyme complexes on a scaffold protein. In Cellulosilyticum lentocellum, we characterise a far smaller arrangement, a single scaffold bound to one cellulase through a single cohesin‐dockerin interaction.
John Allan   +2 more
wiley   +1 more source

Random Trees [PDF]

open access: yes, 2009
The meeting was devoted to random trees, a central concept in mathematics that provides a key way of thinking about relationships between objects such as particles in a fluid, individuals in a population, or labels in a search algorithm.

core   +1 more source

Limits of random trees [PDF]

open access: yesActa Mathematica Hungarica, 2013
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the probability of a given tree is proportional to $\prod_{v_i\in V(T)}d(v_i)!$.
openaire   +2 more sources

Unions of random trees and applications

open access: yesDiscrete Mathematics, 2021
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this result, and we obtain an explicit rate of convergence.
Austen James   +3 more
openaire   +3 more sources

A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi   +17 more
wiley   +1 more source

Thought Experiments in Graphic Design Education

open access: yes, 2013
What happens when we look at graphic design education as a ‘thought experiment’? Thought Experiments in Graphic Design Education documents an international mix of experimental, reflexive and speculative projects made by students, educators and ...
Trees, Joshua, Martinez, Yvan
core   +5 more sources

Non-crossing trees revisited: cutting down and spanning subtrees [PDF]

open access: yesDiscrete 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

Automorphisms of Random Trees.

open access: yes, 2022
We study the size of the automorphism group of two different types of random trees: Galton-Watson trees and Pólya trees. In both cases, we prove that it asymptotically follows a log-normal distribution. While the proof for Galton-Watson trees mainly relies on probabilistic arguments and a general result on additive tree functionals, generating ...
Olsson, Christoffer, Wagner, Stephan
openaire   +3 more sources

Home - About - Disclaimer - Privacy