Results 41 to 50 of about 1,714,979 (285)
Molecular Oncology, EarlyView.This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
The Coherent Covering Location Problem [PDF]
Papers in Regional Science, 1996 body {background-color:#C8102E} h1 {color:white} h2 {color:white} div.text { color: white; float: left; width: 90%; margin-top: 2%; margin-left: 3%; padding: 2%; padding-top: 1%; border: 3px solid #FFF; font-family: Verdana; font-size: 13px; }
openaire +4 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
Dynamic Hub Covering Problem with Flexible Covering Radius
International Journal of Industrial Engineering and Production Research, 2015 One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase
Yahia Zare Mehrjerdi +2 more
doaj
A Meta-Optimization Approach to Solve the Set Covering Problem
Ingeniería, 2018 Context: In the industry the resources are increasingly scarce. For this reason, we must make a good use of it. Being the optimization tools, a good alternative that it is necessary to bear in mind.
Gino Astorga +5 more
doaj +1 more source
Partial Evaluation and Efficient Discarding for the Maximal Covering Location Problem
IEEE Access, 2021 The maximal covering location problem attempts to locate a limited number of facilities in order to maximize the coverage over a set of demand nodes. This problem is NP-Hard and it has been often addressed by using metaheuristics, where the execution ...
Cynthia Porras +3 more
doaj +1 more source
Finite random coverings of one-complexes and the Euler characteristic
, 2014 This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one dimensional case.
Komendarczyk, Rafal, Pullen, Jeffrey
core +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
Hub Arc Covering Location Problem under Disruption [PDF]
چشمانداز مدیریت صنعتی, 2014 Hub networks are among the important variations of transportation networks that have applications in air transportation, post, and telecommunication. An important feature of these networks is the possibility of disruption in the network performance due ...
Ehsan Nikbakhsh +1 more
doaj
Solution of the minimum modulus problem for covering systems [PDF]
, 2016 We answer a question of Erd\H{o}s by showing that the least modulus of a distinct covering system of congruences is no larger than $10^{18}$.Comment: Submitted version, comments ...
Hough, Bob
core