Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis

Alexander A. Loboda, Maxim N. Artyomov, Alexey A. Sergushichev. Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis. In Martin C. Frith, Christian Nørgaard Storm Pedersen, editors, Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Aarhus, Denmark, August 22-24, 2016. Proceedings. Volume 9838 of Lecture Notes in Computer Science, pages 210-221, Springer, 2016. [doi]

Abstract

Abstract is missing.