A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem

The Prize-collecting Steiner Tree Problem (PCSTP) is a well-known problem in graph theory and combinatorial optimization. It has been successfully applied to solve real problems such as fiber-optic and gas distribution networks design. In this work, we concentrate on its application in biology to perform a functional analysis of genes. It is common to analyze large networks in genomics to infer a hidden knowledge. Due to the NP-hard characteristics of the PCSTP, it is computationally costly, if possible, to achieve exact solutions for such huge instances. Therefore, there is a need for fast and efficient matheuristic algorithms to explore and understand the concealed information in huge biological graphs. In this study, we propose a matheuristic method based on clustering algorithm. The main target of the method is to scale up the applicability of the currently available exact methods to large graph instances, without loosing too much on solution quality. The proposed matheuristic method is composed of a preprocessing procedures, a heuristic clustering algorithm and an exact solver for the PCSTP, applied on sub-graphs. We examine the performance of the proposed method on real-world benchmark instances from biology, and compare its results with those of the exact solver alone, without the heuristic clustering. We obtain solutions in shorter execution time and with negligible optimality gaps. This enables analyzing very large biological networks with the currently available exact solvers. HighlightsApplication of Steiner tree problems to genomics.Mathematical programming based heuristic exploiting domain characteristics.Approach able to handle large instances effectively.

[1]  M. Gerstein,et al.  What is a gene, post-ENCODE? History and updated definition. , 2007, Genome research.

[2]  Hanif D. Sherali,et al.  Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint , 2010, Electron. Notes Discret. Math..

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

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

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

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

[7]  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.

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

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

[10]  Matteo Fischetti,et al.  Thinning out Steiner trees: a node-based model for uniform edge costs , 2017, Math. Program. Comput..

[11]  Petra Mutzel,et al.  The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract , 2003, ESA.

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

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

[14]  Roberto Montemanni,et al.  Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks , 2008, Eur. J. Oper. Res..

[15]  Roberto Montemanni,et al.  A matheuristic algorithm for the Prize-collecting Steiner Tree Problem , 2015, 2015 3rd International Conference on Information and Communication Technology (ICoICT).

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

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

[18]  S. Drăghici,et al.  Analysis of microarray experiments of gene expression profiling. , 2006, American journal of obstetrics and gynecology.

[19]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

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

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

[22]  Mohamed Haouari,et al.  A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem , 2006, Comput. Oper. Res..