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 |
Algorithms for Three Versions of the Shortest Common Superstring Problem
|
---|---|
Chapter number | 27 |
Book title |
Combinatorial Pattern Matching
|
Published in |
Lecture notes in computer science, January 2010
|
DOI | 10.1007/978-3-642-13509-5_27 |
Book ISBNs |
978-3-64-213508-8, 978-3-64-213509-5
|
Authors |
Crochemore, Maxime, Cygan, Marek, Iliopoulos, Costas, Kubica, Marcin, Radoszewski, Jakub, Rytter, Wojciech, Waleń, Tomasz, Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń |
Mendeley readers
The data shown below were compiled from readership statistics for 15 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
France | 2 | 13% |
Russia | 2 | 13% |
Italy | 1 | 7% |
Ukraine | 1 | 7% |
Japan | 1 | 7% |
Unknown | 8 | 53% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 4 | 27% |
Student > Master | 3 | 20% |
Other | 2 | 13% |
Student > Ph. D. Student | 2 | 13% |
Student > Bachelor | 1 | 7% |
Other | 2 | 13% |
Unknown | 1 | 7% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 12 | 80% |
Agricultural and Biological Sciences | 1 | 7% |
Medicine and Dentistry | 1 | 7% |
Unknown | 1 | 7% |