Finding supported paths in heterogeneous networks

DOI10.3390/a8040810zbMath1461.68151OpenAlexW1885685411MaRDI QIDQ1736715

Hafedh Mohamed-Babou, Guillaume Fertin, Christian Komusiewicz, Irena Rusu

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8040810

zbMATH Keywords

shortest path problemNP-hard problemsdirected acyclic graphsmetabolic networkslongest path problemprotein interaction networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Systems biology, networks (92C42)

Related Items (1)

Improved approaches to solve the one-to-one skewgram problem

Uses Software

• MySQL
• PathBLAST

Cites Work

• Unnamed Item
• Unnamed Item
• On the parameterized complexity of multiple-interval graph problems
• The directed subgraph homeomorphism problem
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
• Parametrized complexity theory.
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Algorithmic Aspects of Heterogeneous Biological Networks Comparison

This page was built for publication: Finding supported paths in heterogeneous networks