Results 71 to 80 of about 4,092 (253)

Packing chromatic number of transformation graphs

open access: yes, 2019
Graph coloring is an assignment of labels called colors to elements of a graph. The packing coloring was introduced by Goddard et al. [1] in 2008 which is a kind of coloring of a graph. This problem is NP-complete for general graphs.
Ozen Dortok H.B., Durgun D.D.
core   +1 more source

Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae

open access: yesFEBS Open Bio, EarlyView.
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj   +3 more
wiley   +1 more source

S-packing edge-colouring of graphs

open access: yes, 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  

Mycobacterial cell division arrest and smooth‐to‐rough envelope transition using CRISPRi‐mediated genetic repression systems

open access: yesFEBS Open Bio, EarlyView.
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point   +7 more
wiley   +1 more source

Dichotomies properties on computational complexity of S-packing coloring problems

open access: yes, 2014
International audienceThis work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s_1 , ..., s_k ), G is S-colorable, if its vertices ...
Gastineau, Nicolas, Nicolas Gastineau
core  

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

open access: yesFEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

S-packing colouring and its variations

open access: yes, 2020
Tato práce se zabývá oblastí S-pakovacího barvení grafu. Zaměřuje se na obecné S-pakovací barvení a jeho některé speciální varianty, konkrétně na pakovací barvení a distanční barvení.
Kamenická, Karolína
core  

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

open access: yesFEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei   +3 more
wiley   +1 more source

Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems [PDF]

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

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy