Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
From MaRDI portal
Publication:1708434
DOI10.1007/978-3-319-43681-4_17zbMath1383.92010arXiv1605.02168OpenAlexW2386592867MaRDI QIDQ1708434
Maxim N. Artyomov, Alexey A. Sergushichev, Alexander A. Loboda
Publication date: 23 March 2018
Full work available at URL: https://arxiv.org/abs/1605.02168
Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Systems biology, networks (92C42)
Related Items (3)
Method of the Joint Clustering in Network and Correlation Spaces ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ Travelling on graphs with small highway dimension
This page was built for publication: Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
