doi.org/10.1007/978-3-319-43681-4_17
Preview meta tags from the doi.org website.
Linked Hostnames
21- 17 links tolink.springer.com
- 15 links todoi.org
- 11 links toscholar.google.com
- 11 links towww.springernature.com
- 4 links tocitation-needed.springer.com
- 3 links toscholar.google.co.uk
- 3 links tosupport.springernature.com
- 3 links towww.ncbi.nlm.nih.gov
Thumbnail
Search Engine Appearance
Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
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...
Bing
Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
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...
DuckDuckGo
https://doi.org/10.1007/978-3-319-43681-4_17Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
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...
General Meta Tags
39- titleSolving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis | SpringerLink
- charsetUTF-8
- X-UA-CompatibleIE=edge
- viewportwidth=device-width, initial-scale=1
- applicable-devicepc,mobile
Open Graph Meta Tags
6- og:urlhttps://link.springer.com/chapter/10.1007/978-3-319-43681-4_17
- og:typePaper
- og:site_nameSpringerLink
- og:titleSolving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
- og:descriptionNetwork 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...
Twitter Meta Tags
6- twitter:siteSpringerLink
- twitter:cardsummary
- twitter:image:altContent cover image
- twitter:titleSolving Generalized Maximum-Weight Connected Subgraph Problem for Netw
- twitter:descriptionNetwork 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...
Item Prop Meta Tags
3- position1
- position2
- position3
Link Tags
9- apple-touch-icon/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
- canonicalhttps://link.springer.com/chapter/10.1007/978-3-319-43681-4_17
- icon/oscar-static/img/favicons/darwin/android-chrome-192x192.png
- icon/oscar-static/img/favicons/darwin/favicon-32x32.png
- icon/oscar-static/img/favicons/darwin/favicon-16x16.png
Emails
1Links
81- http://arxiv.org/abs/1409.5308
- http://nar.oxfordjournals.org/citmgr?type=bibtex&gca=nar%3Bgkw266v1
- http://scholar.google.co.uk/scholar?as_q=&num=10&btnG=Search+Scholar&as_epq=&as_oq=&as_eq=&as_occt=any&as_sauthors=%22Alexander%20A.%20Loboda%22&as_publication=&as_ylo=&as_yhi=&as_allsubj=all&hl=en
- http://scholar.google.co.uk/scholar?as_q=&num=10&btnG=Search+Scholar&as_epq=&as_oq=&as_eq=&as_occt=any&as_sauthors=%22Alexey%20A.%20Sergushichev%22&as_publication=&as_ylo=&as_yhi=&as_allsubj=all&hl=en
- http://scholar.google.co.uk/scholar?as_q=&num=10&btnG=Search+Scholar&as_epq=&as_oq=&as_eq=&as_occt=any&as_sauthors=%22Maxim%20N.%20Artyomov%22&as_publication=&as_ylo=&as_yhi=&as_allsubj=all&hl=en