English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A problem studied in Systems Biology is how to find shortest paths inmetabolic networks. Unfortunately, simple (i.e., graph theoretic) shortestpaths do not properly reflect biochemical facts. An approach to overcome thisissue is to use edge labels and search for paths with distinct labels.  In this paper, we show that such biologically feasible shortest paths arehard to compute. Moreover, we present solutions to find such paths in networksin reasonable time.

Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks