Results 41 to 50 of about 524,063 (295)
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
All-Pairs Shortest Paths in Geometric Intersection Graphs
Journal of Computational Geometry, 2019 $\newcommand{\OO}[1]{O\left(#1\right)}$We present a simple and general algorithm for the all-pairs shortest paths (APSP) problem in unweighted geometric intersection graphs.
Timothy M. Chan, Dimitrios Skrepetos
doaj +1 more source
MULTI-CRITERIA PATH FINDING [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Path finding solutions are becoming a major part of many GIS applications including location based services and web-based GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel
E. Mohammadi, A. Hunter
doaj +1 more source
bsmock/k-shortest-paths: First official major release
, 2017 <p>This is the first official major release of the k-shortest-paths repository. It contains implementations of three well-known algorithms (Yen, Eppstein, and Lazy Eppstein), as well as a simplified version of Eppstein's algorithm that may be ...
Brandon Smock
core +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Journal of Graph Algorithms and Applications, 2022 Given a set of terminal pairs on the external face of an undirected unweighted planar graph, we give a linear-time algorithm for computing the union of non-crossing shortest paths joining each terminal pair, if such paths exist. This allows us to compute
Lorenzo Balzotti, Paolo Franciosa
doaj +1 more source
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network [PDF]
, 2005 Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms.
Wu, Q, Al-Dabass, D, Hartley, JK
core
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Shortest-Path Kernels on Graphs [PDF]
Fifth IEEE International Conference on Data Mining (ICDM'05), 2006 Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available by defining a kernel function on instances of graphs. Graph kernels based on walks, subtrees and cycles in graphs have been proposed so far. As a general problem, these kernels
Karsten M. Borgwardt, Hans-Peter Kriegel
openaire +4 more sources