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.
Mendeley readers
Chapter title |
Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network
|
---|---|
Chapter number | 14 |
Book title |
Algorithms for Computational Biology
|
Published by |
Springer, Cham, July 2014
|
DOI | 10.1007/978-3-319-07953-0_14 |
Book ISBNs |
978-3-31-907952-3, 978-3-31-907953-0
|
Authors |
Sean Maxwell, Mark R. Chance, Mehmet Koyutürk, Maxwell, Sean, Chance, Mark R., Koyutürk, Mehmet |
Mendeley readers
The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Brazil | 1 | 9% |
Unknown | 10 | 91% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 36% |
Researcher | 2 | 18% |
Professor | 1 | 9% |
Other | 1 | 9% |
Professor > Associate Professor | 1 | 9% |
Other | 1 | 9% |
Unknown | 1 | 9% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 73% |
Biochemistry, Genetics and Molecular Biology | 1 | 9% |
Agricultural and Biological Sciences | 1 | 9% |
Unknown | 1 | 9% |