Results 71 to 80 of about 925,039 (306)
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
AlgorithmsIn this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi +4 more
doaj +1 more source
Greedy Game Algorithms for Solving SET
IEEE Access, 2018 Coverage is a fundamental problem in heterogeneous wireless sensor networks (HWSNs). Lifetime of the HWSNs is another important problem in this area. The K-Cover problem can solve both the coverage and lifetime issues.
Wenjie Yan +3 more
doaj +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Covering t-sets with (t+2)-sets
Discrete Applied Mathematics, 1999 Let \(X\) be a \(v\)-set of points and \({\mathcal B}\) be a family of \(k\)-subsets of \(X\), called blocks. Then the pair \((X,{\mathcal B})\) is called a \(t\)-\((v,k,\lambda)\) covering design if each \(t\)-subset of \(X\) is contained in (or is covered by) at least \(\lambda\) blocks. The minimum size of \({\mathcal B}\) is denoted by \(C_{\lambda}
Kari J. Nurmela +1 more
openaire +2 more sources
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry, 2009 We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained in) at least d(p) sets. Here d(p) is an integer demand (requirement) for p.
Chandra Chekuri +2 more
openaire +2 more sources
Covering of High-Dimensional Sets
, 2022 Let $(\mathcal{X},ρ)$ be a metric space and $λ$ be a Borel measure on this space defined on the $σ$-algebra generated by open subsets of $\mathcal{X}$; this measure $λ$ defines volumes of Borel subsets of $\mathcal{X}$. The principal case is where $\mathcal{X} = \mathbb{R}^d$, $ρ$ is the Euclidean metric, and $λ$ is the Lebesgue measure.
Zhigljavsky, Anatoly, Noonan, Jack
openaire +2 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
A global reference data set for land cover mapping at 10 m resolution [PDF]
Earth System Science DataThis paper presents a unique global reference data set for land cover mapping at a 10 m resolution, aligned with Sentinel-2 imagery for the year 2015. It contains more than 16.5 million data records at a 10 m resolution (or 165 K data records at 100 m ...
M. Lesiv +15 more
doaj +1 more source
A Constructive Characterization of Vertex Cover Roman Trees
Discussiones Mathematicae Graph Theory, 2021 A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera +2 more
doaj +1 more source