Results 91 to 100 of about 1,848,326 (324)
Physarum can compute shortest paths [PDF]
Journal of Theoretical Biology, 2012 Physarum Polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by biologists to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s0 and s1.
Bonifaci V, Mehlhorn K, Varma G
openaire +10 more sources
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
FEBS Open Bio, EarlyView.This review provides an overview of bio‐based polymer sources, their unique functional properties and their environmental impact, and addresses their role as sustainable alternatives. It discusses end‐of‐life options, including composting and anaerobic digestion for renewable energy.
Sabina Kolbl Repinc +8 more
wiley +1 more source
Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The purpose of the work is the development of basic data structures, speed-efficient and memoryefficient algorithms for tracking changes in predefined decisions about sets of shortest paths on transport networks, notifications about which are received by
N. V. Khajynova +2 more
doaj +1 more source
Shortest-Path Reconstruction Algorithms [PDF]
The Computer Journal, 1993 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
ARP-Path: ARP-Based, Shortest Path Bridges [PDF]
IEEE Communications Letters, 2011 This letter is a summary proposal for an evolution of the Ethernet transparent bridge paradigm that provides simple, shortest path bridging in campus networks. ARP-Path Ethernet Switches set up an on-demand path between two hosts just reusing and flooding the standard ARP request frame through all links and confirming the path reaching to the ...
Ibáñez Fernández, Guillermo Agustín +4 more
openaire +3 more sources
Discovery and Targeted Proteomic Studies Reveal Striatal Markers Validated for Huntington's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Clinical trials for Huntington's disease (HD) enrolling persons before clinical motor diagnosis (CMD) lack validated biomarkers. This study aimed to conduct an unbiased discovery analysis and a targeted examination of proteomic biomarkers scrutinized by clinical validation. Methods Cerebrospinal fluid was obtained from PREDICT‐HD and
Daniel Chelsky +8 more
wiley +1 more source
Shortest path counting in probabilistic biological networks
BMC Bioinformatics, 2018 Background Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell.
Yuanfang Ren, Ahmet Ay, Tamer Kahveci
doaj +1 more source
PLoS ONE, 2022 In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is
Ittikon Thammachantuek, Mahasak Ketcham
doaj +1 more source
Shortest-weight paths in random regular graphs [PDF]
, 2012 Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight ...
Amini, Hamed, Peres, Yuval
core +1 more source