%0 Conference Paper %1 conf/wabi/LobodaAS16 %A Loboda, Alexander A. %A Artyomov, Maxim N. %A Sergushichev, Alexey A. %B WABI %D 2016 %E Frith, Martin C. %E Pedersen, Christian Nørgaard Storm %I Springer %K dblp %P 210-221 %T Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis. %U http://dblp.uni-trier.de/db/conf/wabi/wabi2016.html#LobodaAS16 %V 9838 %@ 978-3-319-43680-7

@inproceedings{conf/wabi/LobodaAS16, added-at = {2017-06-05T00:00:00.000+0200}, author = {Loboda, Alexander A. and Artyomov, Maxim N. and Sergushichev, Alexey A.}, biburl = {https://www.bibsonomy.org/bibtex/20f0d9e666ca93e8c689d267b6663c655/dblp}, booktitle = {WABI}, crossref = {conf/wabi/2016}, editor = {Frith, Martin C. and Pedersen, Christian Nørgaard Storm}, ee = {https://doi.org/10.1007/978-3-319-43681-4_17}, interhash = {acf90997fc076625db1cd2e1deca00dc}, intrahash = {0f0d9e666ca93e8c689d267b6663c655}, isbn = {978-3-319-43680-7}, keywords = {dblp}, pages = {210-221}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:18:34.000+0200}, title = {Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis.}, url = {http://dblp.uni-trier.de/db/conf/wabi/wabi2016.html#LobodaAS16}, volume = 9838, year = 2016 }