A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks

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.

[1]  Hanif D. Sherali,et al.  Algorithmic expedients for the Prize Collecting Steiner Tree Problem , 2010, Discret. Optim..

[2]  Alexandre Salles da Cunha,et al.  A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs , 2009, Discret. Appl. Math..

[3]  Tobias Müller,et al.  Identifying functional modules in protein–protein interaction networks: an integrated exact approach , 2008, ISMB.

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[5]  Christian von Mering,et al.  STRING 8—a global view on proteins and their functional interactions in 630 organisms , 2008, Nucleic Acids Res..

[6]  Christian Borgs,et al.  Finding undetected protein associations in cell signaling by belief propagation , 2010, Proceedings of the National Academy of Sciences.

[7]  Matteo Fischetti,et al.  Facets of two Steiner arborescence polyhedra , 1991, Math. Program..

[8]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[9]  Petra Mutzel,et al.  Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.

[10]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[11]  Riccardo Zecchina,et al.  Clustering with shallow trees , 2009, ArXiv.

[12]  William Ritchie,et al.  mimiRNA: a microRNA expression profiler and classification resource designed to identify functional correlations between microRNAs and their targets , 2010, Bioinform..

[13]  Matteo Fischetti,et al.  Solving the Prize-Collecting Steiner Tree Problem to Optimality , 2005, ALENEX/ANALCO.

[14]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[15]  Ernest Fraenkel,et al.  SteinerNet: a web server for integrating ‘omic’ data to discover hidden components of response pathways , 2012, Nucleic Acids Res..

[16]  Michael L. Gatza,et al.  Proteogenomics connects somatic mutations to signaling in breast cancer , 2016, Nature.

[17]  Abraham P. Punnen,et al.  Variations of the prize-collecting Steiner tree problem , 2006, Networks.

[18]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[19]  Roberto Montemanni,et al.  A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem , 2016, Comput. Oper. Res..

[20]  Carlos Eduardo Ferreira,et al.  Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem , 2007, Inf. Process. Lett..

[21]  A. Volgenant,et al.  Some generalizations of the steiner problem in graphs , 1987, Networks.

[22]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[23]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[24]  Christian Borgs,et al.  Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem , 2012, J. Comput. Biol..

[25]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[26]  Christina Backes,et al.  An integer linear programming approach for finding deregulated subgraphs in regulatory networks , 2011, Nucleic acids research.

[27]  Jin-Kao Hao,et al.  Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs , 2017, Knowl. Based Syst..