A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks

DOI10.1007/978-3-319-59776-8_22MaRDI QIDQ2011601zbMATH OpenOpenAlexFDO

Authors Murodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni

Publication date 4 August 2017

Full work available at URL http://hdl.handle.net/1721.1/118381

zbMATH Keywords

biological networksprize-collecting Steiner forest

Mathematics Subject Classification ID

Systems biology, networks (92C42) Algorithms in computer science (68W99)

Recommendations

• A comparison of heuristic methods for the prize-collecting Steiner tree problem and their application in genomics
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Algorithmic expedients for the prize collecting Steiner tree problem
• A primal-dual algorithm for the generalized prize-collecting Steiner forest problem

Cites work

• scientific article; zbMATH DE number 1445375 (Why is no real title available?)
• A comparison of heuristic methods for the prize-collecting Steiner tree problem and their application in genomics
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• A note on the prize collecting traveling salesman problem
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
• Algorithmic expedients for the prize collecting Steiner tree problem
• An SST-based algorithm for the steiner problem in graphs
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Facets of two Steiner arborescence polyhedra
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
• Some generalizations of the steiner problem in graphs
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Variations of the prize‐collecting Steiner tree problem

Cited in

(3)

• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• A comparison of heuristic methods for the prize-collecting Steiner tree problem and their application in genomics
• The Steiner Tree Problem and Its Application to the Modelling of Biomolecular Structures

Describes a project that uses

Uses Software

• STRING

This page was built for publication: A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011601)