| 标题 |
Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis |
| 网址 | |
| DOI | |
| 其它 |
期刊:Lecture Notes in Computer Science 作者:Alexander A. Loboda; Maxim N. Artyomov; Alexey A. Sergushichev 出版日期:2016-01-01 |
| 求助人 | |
| 下载 |
PDF的下载单位、IP信息已删除
(2025-6-4)