  Network enrichment analysis methods allow to identify active modules without
being biased towards a priori defined pathways. One of mathematical
formulations of such analysis is a reduction to a maximum-weight connected
subgraph problem. In particular, in analysis of metabolic networks a
generalized maximum-weight connected subgraph (GMWCS) problem, where both nodes
and edges are scored, naturally arises. Here we present the first to our
knowledge practical exact GMWCS solver. We have tested it on real-world
instances and compared to similar solvers. First, the results show that on
node-weighted instances GMWCS solver has a similar performance to the best
solver for that problem. Second, GMWCS solver is faster compared to the closest
analogue when run on GMWCS instances with edge weights.
