You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Timeline
Mendeley readers
Chapter title |
Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
|
---|---|
Chapter number | 17 |
Book title |
Algorithms in Bioinformatics
|
Published in |
Lecture notes in computer science, August 2016
|
DOI | 10.1007/978-3-319-43681-4_17 |
Book ISBNs |
978-3-31-943680-7, 978-3-31-943681-4
|
Authors |
Alexander A. Loboda, Maxim N. Artyomov, Alexey A. Sergushichev |
Editors |
Martin Frith, Christian Nørgaard Storm Pedersen |
Mendeley readers
The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 13 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 15% |
Researcher | 2 | 15% |
Student > Master | 2 | 15% |
Student > Postgraduate | 1 | 8% |
Unknown | 6 | 46% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 31% |
Biochemistry, Genetics and Molecular Biology | 2 | 15% |
Business, Management and Accounting | 1 | 8% |
Agricultural and Biological Sciences | 1 | 8% |
Medicine and Dentistry | 1 | 8% |
Other | 0 | 0% |
Unknown | 4 | 31% |