| dc.contributor.author | Bertoni, Francesco | |
| dc.contributor.author | Kwee, Ivo | |
| dc.contributor.author | Montemanni, Roberto | |
| dc.contributor.author | Akhmedov, Murodzhon | |
| dc.contributor.author | Lenail, Alexander | |
| dc.contributor.author | Fraenkel, Ernest | |
| dc.date.accessioned | 2018-10-09T13:46:44Z | |
| dc.date.available | 2018-10-09T13:46:44Z | |
| dc.date.issued | 2017-05 | |
| dc.identifier.isbn | 978-3-319-59775-1 | |
| dc.identifier.isbn | 978-3-319-59776-8 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/118381 | |
| dc.description.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 | en_US |
| dc.description.sponsorship | National Institutes of Health (U.S.) (U54-NS-091046) | en_US |
| dc.description.sponsorship | National Institutes of Health (U.S.) (U01-CA184898) | en_US |
| dc.description.sponsorship | Swiss National Science Foundation (205321-147138) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer International Publishing | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/978-3-319-59776-8_22 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | Prof. Fraenkel via Howard Silver | en_US |
| dc.title | A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Biological Engineering | en_US |
| dc.contributor.approver | Fraenkel, Ernest | en_US |
| dc.contributor.mitauthor | Akhmedov, Murodzhon | |
| dc.contributor.mitauthor | Lenail, Alexander | |
| dc.contributor.mitauthor | Fraenkel, Ernest | |
| dc.relation.journal | Integration of AI and OR Techniques in Constraint Programming | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Akhmedov, Murodzhon; LeNail, Alexander; Bertoni, Francesco; Kwee, Ivo; Fraenkel, Ernest; Montemanni, Roberto | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0001-9249-8181 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
