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 |
Geometric Restrictions on Producible Polygonal Protein Chains
|
---|---|
Chapter number | 41 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2003
|
DOI | 10.1007/978-3-540-24587-2_41 |
Book ISBNs |
978-3-54-020695-8, 978-3-54-024587-2
|
Authors |
Erik D. Demaine, Stefan Langerman, Joseph O’Rourke |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 10 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 4 | 40% |
Other | 2 | 20% |
Lecturer > Senior Lecturer | 1 | 10% |
Student > Ph. D. Student | 1 | 10% |
Researcher | 1 | 10% |
Other | 0 | 0% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 70% |
Biochemistry, Genetics and Molecular Biology | 1 | 10% |
Unknown | 2 | 20% |