Results 81 to 90 of about 186,890 (225)
Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems [PDF]
Let U be a universe on n elements, let k be a positive integer, and let ℱ be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from ℱ, covering U with k sets from ℱ, and packing k non-intersecting sets ...
Gaspers, Serge, Li, Jerry Zirui
core +1 more source
Accurate and noninvasive prostate cancer detection using plasma‐derived extracellular vesicle RNA
FEBS Open Bio, EarlyView.Plasma extracellular vesicles were captured with WGA‐conjugated magnetic beads and profiled for RNA biomarkers. A three‐RNA panel (NM_024955, NR_047469, and NR_002564) distinguished prostate cancer from healthy controls and benign prostatic hyperplasia, supporting a simple, noninvasive approach to improve prostate cancer detection.
Hanping Wei, Haoran Wu, Wei Feng
wiley +1 more source
, 2011 Title: Graph coloring problems Author: Bernard Lidický Department: Department of Applied Mathematics Supervisor: doc. RNDr. Jiří Fiala, Ph.D. Abstract: As the title suggests, the central topic of this thesis is graph coloring.
Bernard Lidický, Lidický, Bernard
core
S-packing edge-colouring of graphs
, 2022 Práce se zabývá S-pakovacím hranovým barvením grafů. Nechť S = (s_1, s_2, s_3, ...) je neklesající posloupnost přirozených čísel. S-pakovacím hranovým barvením grafu se rozumí funkce f, která přiřazuje hranám grafu G barvy z množiny {1, 2, 3,...} v ...
Baborová, Karolína
core
Evolution‐guided yeast complementation reveals functional differences in human PSPH variants
FEBS Open Bio, EarlyView.Ancient genomes can help guide which human genetic variants are tested experimentally. This study applies that idea to PSPH, a gene involved in serine biosynthesis, and uses high‐throughput yeast complementation to compare variant function. The findings reveal measurable differences among selected alleles and illustrate the value of evolution‐guided ...
Mauricio Campa‐Álvarez +6 more
wiley +1 more source
FEBS Open Bio, EarlyView.Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty +13 more
wiley +1 more source
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
FEBS Open Bio, EarlyView.Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source
On S-packing coloring of 2-saturated subcubic graphs
International audienceFor a non-decreasing sequence of integers (a 1 , a 2 , . . . , a k ), a graph G is (a 1 , a 2 , . . . , a k )-packing colorable if V (G) can be partitioned into k subsets V 1 , V 2 , . . .
Togni, Olivier, Mortada, Maydoun
core +1 more source
Worst-case analysis for new online bin packing problems [PDF]
, 2013 We consider two new online bin packing problems, the online Variable Cost and Size Bin Packing Problem (o-VCSBPP) and the online Generalized Bin Packing Problem (o-GBPP).
Baldi, Mauro Maria +3 more
core
Every subcubic multigraph is $(1,2^7)$-packing edge-colorable
, 2022 For a non-decreasing sequence $S = (s_1, \ldots, s_k)$ of positive integers, an $S$-packing edge-coloring of a graph $G$ is a decomposition of edges of $G$ into disjoint sets $E_1, \ldots, E_k$ such that for each $1 \le i \le k$ the distance between any ...
Santana, Michael +2 more
core