Results 111 to 120 of about 4,256 (307)
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
Constructing operating theatre schedules using partitioned graph colouring techniques. [PDF]
Health Syst (Basingstoke), 2021 Kheiri A, Lewis R, Thompson J, Harper P.
europepmc +1 more source
, 2008 We consider a generalisation of proper vertex colouring of graphs, referred to as improper colouring, in which each vertex can only be adjacent to a bounded number t of vertices with the same colour, and we study this type of graph colouring problem in several different settings. The thesis is divided into six chapters.
openaire +2 more sources
FEBS 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
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
Discussiones Mathematicae Graph Theory, 2013 A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours.
Fiedorowicz Anna
doaj +1 more source
Allocating resources based on a model of coarse-grained reconfigurable architecture
The Journal of Engineering, 2019 Reconfigurable resource utilisation is a key factor that impacts the performance of reconfigurable instruction set processors (RISPs), which can customise their instruction set for special applications.
Huizhen Zhang +3 more
doaj +1 more source
FEBS 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
Random graph models for wireless communication networks [PDF]
, 2010 PhDThis thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802:11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver.
Song, Linlin
core
Correspondence Colouring and its Applications to List Colouring and Delay Colouring [PDF]
, 2021 In this thesis, we study correspondence colouring and its applications to list colouring and delay colouring. We give a detailed exposition of the paper of Dvořák, and Postle introducing correspondence colouring.
Saleh, Rana
core