Results 121 to 130 of about 978,459 (257)
Molecular Oncology, EarlyView.LVRF (lymphatic and vascular resistance factor) is a VEGFA splice variant upregulated in response to anti‐angiogenic therapy that fosters tumor adaptation through enhanced vascularization, lymphangiogenesis, and metastatic dissemination. Targeting LVRF with fully human neutralizing antibodies disrupts these processes and limits resistant tumor growth ...
Marion David +12 more
wiley +1 more source
Edge coloring total k-labeling of Generalized Peterson Graphs
, 2013 International audienceThe Edge-coloring total k-labeling of a connected graph G is an assignmentf of non negative integers to the vertices and edges of G such thattwo adjacent edges uv and uv′ of G have different weights.
Kheddouci, Hamamache +2 more
core +2 more sources
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
Journal of Graph Algorithms and ApplicationsA $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to ...
Vahan Mkrtchyan
doaj +1 more source
Molecular Oncology, EarlyView.This paper shows that size‐exclusion chromatography and sequential centrifugation applied to seminal plasma enrich for different populations of extracellular vesicles. This may significantly affect the detection and analysis of extracellular vesicle‐associated cancer biomarkers.
Elen Telumyan +8 more
wiley +1 more source
Approximation Algorithms for Distance-2 Edge Coloring [PDF]
, 2002 The authors consider the link scheduling problem for packet radio networks which is assigning channels to the connecting links so that transmission may proceed on all links assigned the same channel simultaneously without collisions.
Marathe, Madhav +4 more
core
Arboricity-Dependent Algorithms for Edge Coloring [PDF]
The problem of edge coloring has been extensively studied over the years. Recently, this problem has received significant attention in the dynamic setting, where we are given a dynamic graph evolving via a sequence of edge insertions and deletions and ...
Costa, Martín +3 more
core +1 more source
Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae
FEBS 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
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source
Modular edge colorings of Mycielskian graphs [PDF]
Transactions on Combinatorics, 2015 Let G be a connected graph of order 3 or more and c:E(G)→Z k (k≥2 ) a k -edge coloring of G where adjacent edges may be colored the same. The color sum s(v) of a vertex v of G is the sum in Z k of the colors of the edges incident with v.
N. Paramaguru, R. Sampathkumar
doaj
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