Results 41 to 50 of about 190,109 (292)
On Graphs Coverable by \({k}\) Shortest Paths
SIAM Journal on Discrete MathematicsWe show that if the edges or vertices of an undirected graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is upper-bounded by a single-exponential function of $k$. As a corollary, we prove that the problem Isometric Path Cover with Terminals (which, given a graph $G$ and a set of $k$ pairs of vertices called terminals, asks ...
Dumas, Maël +3 more
openaire +5 more sources
On finding the k shortest paths in RDF data [PDF]
Proceedings of Intelligent Exploration of Semantic Data, 2016 Filtz, Erwin +2 more
openaire +4 more sources
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
A new O(m + kn log d) algorithm to Find the k shortest paths in acyclic digraphs [PDF]
Transactions on Combinatorics, 2016 We give an algorithm, called T*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.First the nodes of the graph are labeled according to the topologicalordering.
Mehdi Kadivar
doaj
Applicable Prevention Method of Braess Paradox in Urban Traffic Flow Guidance System [PDF]
International Journal of Computational Intelligence Systems, 2011 Urban Traffic Flow Guidance System (UTFGS) may cause the overreaction and concentration of travelers and lead to the phenomenon of Braess Paradox. The paper develops a constrained K-shortest paths algorithm within a dynamic restricted searching area in ...
Zhaosheng Yang +3 more
doaj +1 more source
A Tight Bound for Shortest Augmenting Paths on Trees
, 2017 The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it has been widely applied in many different settings.
Bosek, Bartłomiej +3 more
core +1 more source
PICALM::MLLT10 translocated leukemia
FEBS Letters, EarlyView.This comprehensive review of PICALM::MLLT10 translocated acute leukemia provides an in‐depth review of the structure and function of CALM, AF10, and the fusion oncoprotein (1). The multifaceted molecular mechanisms of oncogenesis, including nucleocytoplasmic shuttling (2), epigenetic modifications (3), and disruption of endocytosis (4), are then ...
John M. Cullen +7 more
wiley +1 more source
BMC Genetics, 2020 Background Genome-wide association studies (GWAS) have successfully identified genetic susceptible variants for complex diseases. However, the underlying mechanism of such association remains largely unknown. Most disease-associated genetic variants have
Yuchen Zhu +9 more
doaj +1 more source
Finding k-Dissimilar Paths with Minimum Collective Length
, 2018 Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough.
Blumenthal, David B. +4 more
core +1 more source
FEBS Letters, EarlyView.This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source