A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks
Name
Fraenkel-CPAIOR_2017_paper_76.pdf
Description
Main article
Size
1.01 MB
Format
Adobe PDF
Checksum (MD5)
6ddb2685f1bbfcca5982305d17fd0e74
Author(s)
Bertoni, Francesco
Kwee, Ivo
Montemanni, Roberto
Akhmedov, Murodzhon
Lenail, Alexander
Fraenkel, Ernest
Date Issued
May 2017
Journal
Integration of AI and OR Techniques in Constraint Programming
Publisher
Springer International Publishing
Citation
Akhmedov, Murodzhon, et al. “A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks.” Integration of AI and OR Techniques in Constraint Programming, edited by Domenico Salvagnin and Michele Lombardi, vol. 10335, Springer International Publishing, 2017, pp. 263–76.
Version
Author's final manuscript
Abstract
The Prize-collecting Steiner Forest (PCSF) problem is NP-hard, requiring extreme computational effort to find exact solutions for large inputs. We introduce a new heuristic algorithm for PCSF which preserves the quality of solutions obtained by previous heuristic approaches while reducing the runtime by a factor of 10 for larger graphs. By decreasing the draw on computational resources, this algorithm affords systems biologists the opportunity to analyze larger biological networks faster and narrow their analyses to individual patients. Keywords: Prize-collecting Steiner Forest, Biological networks
MIT Department
Massachusetts Institute of Technology. Department of Biological Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-59776-8_22
