Results 81 to 90 of about 524,063 (295)
Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley +1 more source
Journal of Advanced Transportation, 2022 Traffic information and driving preference play critical roles in the route selection of drivers and further impact transport management in practice.
Shiguang Wang, Heng Ding, Zeyang Cheng
doaj +1 more source
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS Open Bio, EarlyView.An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 more
wiley +1 more source
Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
Journal of Telecommunications and Information Technology, 2018 The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such
Shylashree Nagaraja
doaj +1 more source
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +1 more source
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
FEBS Open Bio, EarlyView.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
Counting Vertex-Disjoint Shortest Paths in Graphs
, 2021 Finding a shortest path in a graph is at the core of many combinatorial search problems. A closely related problem refers to counting the number of shortest paths between two nodes.
Marinescu, Radu +4 more
core +1 more source
High Health Care Utilization Preceding Diagnosis With Juvenile Idiopathic Arthritis
Arthritis Care &Research, EarlyView.Objective Although early diagnosis improves long‐term outcomes, patients with juvenile idiopathic arthritis (JIA) often experience prolonged, circuitous paths to diagnosis. To inform diagnostic improvement, we sought to characterize health care utilization in the year preceding diagnosis. Methods We identified 10,021 patients with an incident diagnosis
Anna Costello +5 more
wiley +1 more source
Secluded Path via Shortest Path [PDF]
, 2014 We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3,5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight ...
Matthew P. Johnson 0001 +2 more
openaire +2 more sources