Results 51 to 60 of about 2,616,817 (282)
Deciding the Feasibility and Minimizing the Height of Tangles
We study the following combinatorial problem. Given a set of $n$ y-monotone Jordan curves, called wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders of the wires on any two consecutive layers differ ...
Oksana Firman +5 more
doaj +1 more source
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE).
Nodari Sitchinava, Darren Strash
doaj +1 more source
We established the avian chorioallantoic membrane (CAM) assay as a scalable in vivo model for studying circulating tumor cells (CTCs). Human gastrointestinal tumors spontaneously released genetically validated CTCs that were detected across multiple platforms, demonstrating that the CAM model provides an accessible tool for investigating early cancer ...
Dennis Roth +17 more
wiley +1 more source
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
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]
In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann +2 more
doaj +1 more source
Research is strongest when conducted alongside patients, not just about them. Patient research organizations help integrate patient perspectives into research priorities, study design, and scientific meetings, leading to meaningful patient outcomes and development of relevant therapies.
Jenica H. Kakadia +9 more
wiley +1 more source
The Parameterized Complexity of the Rainbow Subgraph Problem
The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner +3 more
doaj +1 more source
The energy cost minimization for mission-critical internet-of-things (IoT) in mobile edge computing (MEC) system is investigated in this work. Therein, short data packets are transmitted between the IoT devices and the access points (APs) to reduce ...
Yaru Fu +6 more
doaj +1 more source
Fixed Parameter Tractable Algorithms in Combinatorial Topology [PDF]
16 pages, 9 ...
Benjamin A. Burton, William Pettersson
openaire +5 more sources
GelMA‐based 3D spheroids recapitulate transcriptomic and functional hallmarks of myeloid sarcoma
GelMA 5% hydrogels support the formation of myeloid leukemia spheroids that recapitulate MS‐specific features, including G1 arrest, apoptosis, and ECM‐driven transcriptomic reprogramming. The 3D model mimicked soft‐tissue‐like stiffness and oxygen conditions, and transcriptomic convergence with primary MS samples confirmed its utility as a preclinical ...
Nicolas Germain +11 more
wiley +1 more source

