Results 101 to 110 of about 1,378,752 (293)
Pseudorandom binary functions on rooted plane trees [PDF]
, 2012 International audienceIn an earlier paper the authors considered r-almost s-uniform trees, i.e. rooted planar trees T such that the root has r successors, and every other vertex has s suc- cessors.
Hubert, Pascal +2 more
core +1 more source
Journal of Combinatorial Theory, Series A, 2012 A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible and $T$ displays $\cP$.
openaire +3 more sources
Iterative Formulas for Enumerating Binary Trees
, 1997 Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this paper, we give our solutions by iterative formulas for
牛島, 和夫 +2 more
core
Robots and Minimal, Physics‐Informed Features: A Hybrid Framework for Enzyme Catalysis
Advanced Science, EarlyView.Robotic experimentation and physics‐informed machine learning combine to predict enzyme substrate scope. With a handful of interpretable features derived from docking and quantum mechanics calculations, our model rivals descriptor‐heavy AI approaches and extrapolates to unseen substrates and enzyme classes.
Natalia Onishchenko +8 more
wiley +1 more source
Advanced Science, EarlyView.Non‐canonical amino acids (ncAAs) enhance peptide therapeutics but remain difficult to model computationally. SinCAA, a similarity‐enhanced pretraining framework, jointly optimizes contrastive learning guided by a novel conformational similarity metric with masked node reconstruction, capturing both functional relationships and chemical identity of ...
Chencheng Xu +8 more
wiley +1 more source
An example related to Whitney’s extension problem for L 2,p (R2) when 1 < p < 2
Advanced Nonlinear StudiesIn this paper, we prove the existence of a bounded linear extension operator T:L2,p(E)→L2,p(R2) $T:{L}^{2,p}\left(E\right)\to {L}^{2,p}\left({\mathbb{R}}^{2}\right)$ when 1 < p < 2, where E⊂R2 $E\subset {\mathbb{R}}^{2}$ is a certain discrete set with ...
Carruth Jacob, Israel Arie
doaj +1 more source
Biology, 2016 Embryonic development proceeds through a series of differentiation events. The mosaic version of this process (binary cell divisions) can be analyzed by comparing early development of Ciona intestinalis and Caenorhabditis elegans.
Bradly Alicea, Richard Gordon
doaj +1 more source
Efficient implementation of lazy suffix trees [PDF]
, 2003 Giegerich R, Kurtz S, Stoye J. Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE. 2003;33(11):1035-1049.We present an efficient implementation of a write-only top-down construction for suffix trees.
Stoye, Jens ; https://orcid.org/ +2 more
core +1 more source
Advanced Science, EarlyView.This study characterizes MfAgo, an enzyme exhibiting highly efficient DNA‐guided DNA and RNA cleavage capability. Precise RNA cleavage strictly requires dimerization to stabilize the PIWI‐loop region, while its robust DNA cleavage functions in a dimerization‐independent manner.
Fuyong Huang +9 more
wiley +1 more source
Two Access Methods Using Compact Binary Trees [PDF]
, 1987 It is shown how a highly compact representation of binary trees can be used as the basis of two access methods for dynamic files, called BDS-trees and S-trees, respectively.
Jonge, W. de +2 more
core +1 more source