Results 41 to 50 of about 13,357,344 (331)
GEN1 from a thermophilic fungus is functionally closely similar to non-eukaryotic junction-resolving enzymes [PDF]
, 2014 Processing of Holliday junctions is essential in recombination. We have identified the gene for the junction-resolving enzyme GEN1 from the thermophilic fungus Chaetomium thermophilum, and expressed the N-terminal 487 amino acid section. The protein is a
Lilley, David M.J. +8 more
core +1 more source
Resolving-power dominating sets
Applied Mathematics and Computation, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sudeep Stephen +3 more
openaire +3 more sources
Levenshtein graphs: Resolvability, automorphisms & determining sets
Discrete Mathematics, 2023 22 pages, 3 ...
Perrin E. Ruth, Manuel E. Lladser
openaire +3 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure.
PLoS ONE, 2023 The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +1 more source
On the Minimum Differentially Resolving Set Problem for Diffusion Source Inference in Networks
AAAI Conference on Artificial Intelligence, 2016 In this paper we theoretically study the minimum Differentially Resolving Set (DRS) problem derived from the classical sensor placement optimization problem in network source locating.
Chuan Zhou +5 more
semanticscholar +1 more source
On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks
Complex, 2021 In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an
Hua Wang +4 more
semanticscholar +1 more source
Kyoto Journal of Mathematics, 1986 We want to add here another two proofs that the resolvent set of a linear operator is open. The first proof depends on the Hahn-Banach theorem and the second on the Neumann series construction of a linear isomorphism between Ran(A-\(\lambda)\) and Ran(A-\(\mu)\).
Ikebe, Teruo, Yoshioka, Takashi
openaire +3 more sources
Restrained 2-Resolving Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
Resolving Transition Metal Chemical Space: Feature Selection for Machine Learning and Structure-Property Relationships. [PDF]
Journal of Physical Chemistry A, 2017 Machine learning (ML) of quantum mechanical properties shows promise for accelerating chemical discovery. For transition metal chemistry where accurate calculations are computationally costly and available training data sets are small, the molecular ...
J. Janet, Heather J. Kulik
semanticscholar +1 more source
Resolving sets for Johnson and Kneser graphs
European Journal of Combinatorics, 2013 A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions,
Robert F. Bailey +6 more
openaire +4 more sources