Results 71 to 80 of about 1,363,530 (305)
Parametric shortest-path algorithms via tropical geometry [PDF]
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry.
Schröter, Benjamin +5 more
core +1 more source
Secluded Path via Shortest Path [PDF]
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
Protocol for quantifying miRNA trafficking across the endosomal membrane
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
Lasso formulation of the shortest path problem [PDF]
The shortest path problem is formulated as an l1-regularized regression problem, known as lasso. Based on this formulation, a connection is established between Dijkstra's shortest path algorithm and the least angle regression (LARS) for the lasso problem.
Dong, Anqi +5 more
core +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
Heuristic estimates in shortest path algorithms [PDF]
Shortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates.
Pijls, W.H.L.M. (Wim)
core +2 more sources
Shortest-Path Reconstruction Algorithms [PDF]
Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire +2 more sources
Recent insights into the molecular mechanism of ubiquinol oxidation by cytochrome bc1
The review reflects on the mechanism of the catalytic reaction in cytochrome bc1: the electron bifurcation that involves the separation of two electrons derived from the quinol oxidation to opposite sides of the enzyme across the membrane. This review summarizes the long‐standing effort to understand the mechanism of quinol oxidation catalyzed by ...
Anna Wójcik‐Augustyn +2 more
wiley +1 more source
How good (or bad) is shortest path routing in layered networks
Shortest path routing is used throughout the Internet. If link costs accurately reflect real costs of installation and maintenance, and the total network cost is accurately modelled as the sum of link costs, shortest path routing can be expected to ...
Li, Fan +9 more
core +1 more source
A nationwide student survey on biochemistry learning resources in Italy
We conducted a survey among Italian university students to investigate their preferred study materials for biochemistry. We then analyzed the collected data to identify these materials. This information may be valuable to the Biochemistry educational community. The graphical abstract was created with Claude (Opus 5.5; Anthropic, 2026).
Anna Marabotti +4 more
wiley +1 more source

